Update Solution.java

Author: javadev

src/main/java/g3001_3100/s3086_minimum_moves_to_pick_k_ones/Solution.java

@@ -26,15 +26,13 @@ public long minimumMoves(int[] nums, int k, int maxChanges) {
                 return Math.max(0, maxAdjLen - 1) + (k - maxAdjLen) * 2L;
             }
         }
-
         int[] ones = new int[numOne];
         int ind = 0;
         for (int i = 0; i < n; i++) {
             if (nums[i] == 1) {
                 ones[ind++] = i;
             }
         }
-
         long[] preSum = new long[ones.length + 1];
         for (int i = 1; i < preSum.length; i++) {
             preSum[i] = preSum[i - 1] + ones[i - 1];