Improved task 1674.

Author: javadev

README.md

@@ -2394,7 +2394,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.12'
 | 1679 |[Max Number of K-Sum Pairs](src.save/main/java/g1601_1700/s1679_max_number_of_k_sum_pairs/Solution.java)| Medium | Array, Hash_Table, Sorting, Two_Pointers | 20 | 91.22
 | 1678 |[Goal Parser Interpretation](src.save/main/java/g1601_1700/s1678_goal_parser_interpretation/Solution.java)| Easy | String, Programming_Skills_I_Day_8_String | 0 | 100.00
 | 1675 |[Minimize Deviation in Array](src.save/main/java/g1601_1700/s1675_minimize_deviation_in_array/Solution.java)| Hard | Array, Greedy, Heap_Priority_Queue, Ordered_Set | 104 | 88.83
-| 1674 |[Minimum Moves to Make Array Complementary](src.save/main/java/g1601_1700/s1674_minimum_moves_to_make_array_complementary/Solution.java)| Medium | Array, Hash_Table, Prefix_Sum | 29 | 22.22
+| 1674 |[Minimum Moves to Make Array Complementary](src.save/main/java/g1601_1700/s1674_minimum_moves_to_make_array_complementary/Solution.java)| Medium | Array, Hash_Table, Prefix_Sum | 12 | 80.39
 | 1673 |[Find the Most Competitive Subsequence](src.save/main/java/g1601_1700/s1673_find_the_most_competitive_subsequence/Solution.java)| Medium | Array, Greedy, Stack, Monotonic_Stack | 7 | 96.82
 | 1672 |[Richest Customer Wealth](src.save/main/java/g1601_1700/s1672_richest_customer_wealth/Solution.java)| Easy | Array, Matrix, Programming_Skills_I_Day_6_Array | 0 | 100.00
 | 1671 |[Minimum Number of Removals to Make Mountain Array](src.save/main/java/g1601_1700/s1671_minimum_number_of_removals_to_make_mountain_array/Solution.java)| Hard | Array, Dynamic_Programming, Greedy, Binary_Search | 19 | 81.23

src.save/main/java/g1601_1700/s1674_minimum_moves_to_make_array_complementary/Solution.java

@@ -1,27 +1,25 @@
 package g1601_1700.s1674_minimum_moves_to_make_array_complementary;
 
-// #Medium #Array #Hash_Table #Prefix_Sum #2022_04_19_Time_29_ms_(22.22%)_Space_96.3_MB_(14.29%)
+// #Medium #Array #Hash_Table #Prefix_Sum #2022_08_19_Time_12_ms_(80.39%)_Space_82.3_MB_(62.74%)
 
 public class Solution {
     public int minMoves(int[] nums, int limit) {
-        int[] cnt = new int[limit * 2 + 1];
-        int[] min = new int[limit * 2 + 1];
-        int[] max = new int[limit * 2 + 2];
+        int[] delta = new int[2 * limit + 2];
         int n = nums.length;
-        int res = Integer.MAX_VALUE;
         for (int i = 0; i < n / 2; i++) {
-            cnt[nums[i] + nums[n - i - 1]]++;
-            min[Math.min(nums[i], nums[n - i - 1])]++;
-            max[Math.max(nums[i], nums[n - i - 1]) + limit + 1]++;
+            int a = nums[i];
+            int b = nums[n - 1 - i];
+            delta[2] += 2;
+            delta[Math.min(a, b) + 1]--;
+            delta[a + b]--;
+            delta[a + b + 1]++;
+            delta[Math.max(a, b) + limit + 1]++;
         }
-        for (int i = limit * 2 - 1; i >= 2; i--) {
-            min[i] += min[i + 1];
-        }
-        for (int i = 3; i < limit * 2 + 1; i++) {
-            max[i] += max[i - 1];
-        }
-        for (int i = 2; i < limit * 2 + 1; i++) {
-            res = Math.min(res, n / 2 - cnt[i] + min[i] + max[i]);
+        int res = 2 * n;
+        int curr = 0;
+        for (int i = 2; i <= 2 * limit; i++) {
+            curr += delta[i];
+            res = Math.min(res, curr);
         }
         return res;
     }