style: format code and docs with prettier

solution/3000-3099/3026.Maximum Good Subarray Sum/README.md

@@ -179,15 +179,14 @@ function maximumSubarraySum(nums: number[], k: number): number {
         if (t !== undefined) {
             r = Math.max(r, s - t);
         }
-        if (i + 1 === n)
-            break;
+        if (i + 1 === n) break;
         t = p.get(nums[i + 1]);
         if (t === undefined || t > s) {
             p.set(nums[i + 1], s);
         }
     }
     return r === Number.MIN_SAFE_INTEGER ? 0 : r;
-};
+}
 ```
 
 <!-- tabs:end -->

solution/3000-3099/3026.Maximum Good Subarray Sum/README_EN.md

@@ -175,15 +175,14 @@ function maximumSubarraySum(nums: number[], k: number): number {
         if (t !== undefined) {
             r = Math.max(r, s - t);
         }
-        if (i + 1 === n)
-            break;
+        if (i + 1 === n) break;
         t = p.get(nums[i + 1]);
         if (t === undefined || t > s) {
             p.set(nums[i + 1], s);
         }
     }
     return r === Number.MIN_SAFE_INTEGER ? 0 : r;
-};
+}
 ```
 
 <!-- tabs:end -->

solution/3000-3099/3026.Maximum Good Subarray Sum/Solution.ts

@@ -1,23 +1,22 @@
 const p: Map<number, number> = new Map();
-    let r: number = Number.MIN_SAFE_INTEGER;
-    p.set(nums[0], 0);
-    let s: number = 0;
-    const n: number = nums.length;
-    for (let i = 0; ; ++i) {
-        s += nums[i];
-        let t: number | undefined = p.get(nums[i] - k);
-        if (t !== undefined) {
-            r = Math.max(r, s - t);
-        }
-        t = p.get(nums[i] + k);
-        if (t !== undefined) {
-            r = Math.max(r, s - t);
-        }
-        if (i + 1 === n)
-            break;
-        t = p.get(nums[i + 1]);
-        if (t === undefined || t > s) {
-            p.set(nums[i + 1], s);
-        }
+let r: number = Number.MIN_SAFE_INTEGER;
+p.set(nums[0], 0);
+let s: number = 0;
+const n: number = nums.length;
+for (let i = 0; ; ++i) {
+    s += nums[i];
+    let t: number | undefined = p.get(nums[i] - k);
+    if (t !== undefined) {
+        r = Math.max(r, s - t);
     }
-    return r === Number.MIN_SAFE_INTEGER ? 0 : r;
+    t = p.get(nums[i] + k);
+    if (t !== undefined) {
+        r = Math.max(r, s - t);
+    }
+    if (i + 1 === n) break;
+    t = p.get(nums[i + 1]);
+    if (t === undefined || t > s) {
+        p.set(nums[i + 1], s);
+    }
+}
+return r === Number.MIN_SAFE_INTEGER ? 0 : r;