style: format code and docs with prettier

Author: samarthswami1016

solution/3500-3599/3500.Minimum Cost to Divide Array Into Subarrays/README.md

@@ -98,7 +98,7 @@ class Solution:
         n = len(nums)
         sumN = [0] * (n + 1)
         sumC = [0] * (n + 1)
-        
+
         for i in range(1, n + 1):
             sumN[i] = sumN[i - 1] + nums[i - 1]
             sumC[i] = sumC[i - 1] + cost[i - 1]
@@ -183,7 +183,7 @@ class Solution {
             if (start == n) return 0;
             return Long.MAX_VALUE;
         }
-        
+
         if (dp[start][end] != null) return dp[start][end];
 
         long currentNumsSum = prefixNums[end], currentCostSum = prefixCosts[n - 1];
@@ -212,14 +212,14 @@ class Solution {
     public:
         long long minimumCost(vector<int>& nums, vector<int>& cost, int K) {
             int n = nums.size();
-    
+
             long long sn[n + 1], sc[n + 1];
             sn[0] = sc[0] = 0;
             for (int i = 1; i <= n; i++) {
                 sn[i] = sn[i - 1] + nums[i - 1];
                 sc[i] = sc[i - 1] + cost[i - 1];
             }
-    
+
             const long long INF = 1e18;
             long long f[n + 1];
             for (int i = 0; i <= n; i++) f[i] = INF;
@@ -228,11 +228,11 @@ class Solution {
                 long long t = sn[i] * (sc[i] - sc[j]) + K * (sc[n] - sc[j]);
                 f[i] = min(f[i], f[j] + t);
             }
-    
+
             return f[n];
         }
     };
-	
+
 ```
 
 #### Go

solution/3500-3599/3500.Minimum Cost to Divide Array Into Subarrays/README_EN.md

@@ -93,7 +93,7 @@ class Solution:
         n = len(nums)
         sumN = [0] * (n + 1)
         sumC = [0] * (n + 1)
-        
+
         for i in range(1, n + 1):
             sumN[i] = sumN[i - 1] + nums[i - 1]
             sumC[i] = sumC[i - 1] + cost[i - 1]
@@ -178,7 +178,7 @@ class Solution {
             if (start == n) return 0;
             return Long.MAX_VALUE;
         }
-        
+
         if (dp[start][end] != null) return dp[start][end];
 
         long currentNumsSum = prefixNums[end], currentCostSum = prefixCosts[n - 1];
@@ -207,14 +207,14 @@ class Solution {
     public:
         long long minimumCost(vector<int>& nums, vector<int>& cost, int K) {
             int n = nums.size();
-    
+
             long long sn[n + 1], sc[n + 1];
             sn[0] = sc[0] = 0;
             for (int i = 1; i <= n; i++) {
                 sn[i] = sn[i - 1] + nums[i - 1];
                 sc[i] = sc[i - 1] + cost[i - 1];
             }
-    
+
             const long long INF = 1e18;
             long long f[n + 1];
             for (int i = 0; i <= n; i++) f[i] = INF;
@@ -223,7 +223,7 @@ class Solution {
                 long long t = sn[i] * (sc[i] - sc[j]) + K * (sc[n] - sc[j]);
                 f[i] = min(f[i], f[j] + t);
             }
-    
+
             return f[n];
         }
     };