fmt

Author: NotFish232

src/cpp_solutions/2448_minimum-cost-to-make-array-equal.cpp

@@ -1,6 +1,5 @@
-#include <vector>
 #include <algorithm>
-
+#include <vector>
 
 using namespace std;
 
@@ -39,7 +38,6 @@ class Solution {
 
             cost_pre_sum += v[i].second;
             cost_post_sum -= v[i].second;
-
         }
 
         return ans;

src/cpp_solutions/376_wiggle-subsequence.cpp

@@ -13,7 +13,6 @@ class Solution {
         el[0][0] = nums[0];
         el[0][1] = nums[0];
 
-
         for (int i = 1; i < nums.size(); ++i) {
             if (nums[i] > el[i - 1][1]) {
                 dp[i][0] = dp[i - 1][1] + 1;