solves maximize sum of array in java

Author: anishLearnsToCode

README.md

@@ -270,7 +270,7 @@
 | 997 | [Find the Town Judge](https://leetcode.com/problems/find-the-town-judge) | [![Java](assets/java.png)](src/FindTheTownJudge.java) |
 | 999 | [Available Captures for Rook](https://leetcode.com/problems/available-captures-for-rook) | [![Java](assets/java.png)](src/AvailableCapturesForRook.java) |
 | 1002 | [Find Common Characters](https://leetcode.com/problems/find-common-characters) | [![Java](assets/java.png)](src/FindCommonCharacters.java) |
-| 1005 | [Maximize Sum of Array After K Negations](https://leetcode.com/problems/maximize-sum-of-array-after-k-negations) | |
+| 1005 | [Maximize Sum of Array After K Negations](https://leetcode.com/problems/maximize-sum-of-array-after-k-negations) | [![Java](assets/java.png)](src/MaximizeSumOfArrayAfterKNegations.java) |
 | 1009 | [Complement of Base 10 Integer](https://leetcode.com/problems/complement-of-base-10-integer) | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/NumberComplement.java) |
 | 1010 | [Pairs of Songs With Total Durations Divisible by 60](https://leetcode.com/problems/pairs-of-songs-with-total-durations-divisible-by-60) | |
 | 1013 | [Partition Array into Three Parts with equal Sum](https://leetcode.com/problems/partition-array-into-three-parts-with-equal-sum) | |

src/MaximizeSumOfArrayAfterKNegations.java

@@ -0,0 +1,26 @@
+import java.util.Arrays;
+
+public class MaximizeSumOfArrayAfterKNegations {
+    public int largestSumAfterKNegations(int[] nums, int k) {
+        Arrays.sort(nums);
+        int sum = 0, index = 0;
+        for ( ; index < nums.length && k > 0 ; index++) {
+            if (nums[index] < 0) {
+                sum -= nums[index];
+                k--;
+            } else break;
+        }
+        if ((k & 1) == 1) {
+            if (index < nums.length) {
+                if (index == 0) sum -= nums[index];
+                else if (-nums[index - 1] < nums[index]) sum += 2 * nums[index - 1] + nums[index];
+                else sum -= nums[index];
+                index++;
+            } else return sum + 2 * nums[nums.length - 1];
+        }
+        for ( ; index < nums.length ; index++) {
+            sum += nums[index];
+        }
+        return sum;
+    }
+}