fix: cpp code

Author: yanglbme

solution/3000-3099/3086.Minimum Moves to Pick K Ones/Solution.cpp

@@ -4,44 +4,44 @@ class Solution {
         int n = nums.size();
         vector<int> cnt(n + 1, 0);
         vector<long long> s(n + 1, 0);
-        
+
         for (int i = 1; i <= n; ++i) {
             cnt[i] = cnt[i - 1] + nums[i - 1];
             s[i] = s[i - 1] + 1LL * i * nums[i - 1];
         }
-        
+
         long long ans = LLONG_MAX;
-        
+
         for (int i = 1; i <= n; ++i) {
             long long t = 0;
             int need = k - nums[i - 1];
-            
+
             for (int j = i - 1; j <= i + 1; j += 2) {
                 if (need > 0 && 1 <= j && j <= n && nums[j - 1] == 1) {
                     --need;
                     ++t;
                 }
             }
-            
+
             int c = min(need, maxChanges);
             need -= c;
             t += c * 2;
-            
+
             if (need <= 0) {
                 ans = min(ans, t);
                 continue;
             }
-            
+
             int l = 2, r = max(i - 1, n - i);
-            
+
             while (l <= r) {
                 int mid = (l + r) / 2;
                 int l1 = max(1, i - mid), r1 = max(0, i - 2);
                 int l2 = min(n + 1, i + 2), r2 = min(n, i + mid);
-                
+
                 int c1 = cnt[r1] - cnt[l1 - 1];
                 int c2 = cnt[r2] - cnt[l2 - 1];
-                
+
                 if (c1 + c2 >= need) {
                     long long t1 = 1LL * c1 * i - (s[r1] - s[l1 - 1]);
                     long long t2 = s[r2] - s[l2 - 1] - 1LL * c2 * i;
@@ -52,7 +52,7 @@ class Solution {
                 }
             }
         }
-        
+
         return ans;
     }
 };