Add solution #1005

Author: JoshCrozier

README.md

@@ -281,6 +281,7 @@
 997|[Find the Town Judge](./0997-find-the-town-judge.js)|Easy|
 1002|[Find Common Characters](./1002-find-common-characters.js)|Easy|
 1004|[Max Consecutive Ones III](./1004-max-consecutive-ones-iii.js)|Medium|
+1005|[Maximize Sum Of Array After K Negations](./1005-maximize-sum-of-array-after-k-negations.js)|Easy|
 1009|[Complement of Base 10 Integer](./1009-complement-of-base-10-integer.js)|Easy|
 1010|[Pairs of Songs With Total Durations Divisible by 60](./1010-pairs-of-songs-with-total-durations-divisible-by-60.js)|Medium|
 1022|[Sum of Root To Leaf Binary Numbers](./1022-sum-of-root-to-leaf-binary-numbers.js)|Easy|

solutions/1005-maximize-sum-of-array-after-k-negations.js

@@ -0,0 +1,27 @@
+/**
+ * 1005. Maximize Sum Of Array After K Negations
+ * https://leetcode.com/problems/maximize-sum-of-array-after-k-negations/
+ * Difficulty: Easy
+ *
+ * Given an integer array nums and an integer k, modify the array in the following way:
+ * - choose an index i and replace nums[i] with -nums[i].
+ *
+ * You should apply this process exactly k times. You may choose the same index i
+ * multiple times.
+ *
+ * Return the largest possible sum of the array after modifying it in this way.
+ */
+
+/**
+ * @param {number[]} nums
+ * @param {number} k
+ * @return {number}
+ */
+var largestSumAfterKNegations = function(nums, k) {
+  while (k) {
+    const i = nums.indexOf(Math.min(...nums));
+    nums[i] *= -1;
+    k--;
+  }
+  return nums.reduce((sum, n) => sum + n, 0);
+};