Fixed style

Author: javadev

src/main/java/g3401_3500/s3428_maximum_and_minimum_sums_of_at_most_size_k_subsequences/Solution.java

@@ -7,7 +7,8 @@
 
 public class Solution {
     private static final int MOD = (int) 1e9 + 7;
-    private static long[] fact, invFact;
+    private long[] fact;
+    private long[] invFact;
 
     public int minMaxSums(int[] nums, int k) {
         int n = nums.length;
@@ -46,14 +47,18 @@ private void buildFactorials(int n) {
     }
 
     private long comb(int n, int r) {
-        if (r < 0 || r > n) return 0;
+        if (r < 0 || r > n) {
+            return 0;
+        }
         return fact[n] * invFact[r] % MOD * invFact[n - r] % MOD;
     }
 
     private long pow(long base, int exp) {
         long ans = 1L;
         while (exp > 0) {
-            if ((exp & 1) == 1) ans = (ans * base) % MOD;
+            if ((exp & 1) == 1) {
+                ans = (ans * base) % MOD;
+            }
             base = (base * base) % MOD;
             exp >>= 1;
         }

src/main/java/g3401_3500/s3430_maximum_and_minimum_sums_of_at_most_size_k_subarrays/Solution.java

@@ -13,7 +13,9 @@ public long minMaxSubarraySum(int[] nums, int k) {
 
     private long solve(int[] nums, int k) {
         int n = nums.length;
-        int[] left = new int[n], right = new int[n], st = new int[n];
+        int[] left = new int[n];
+        int[] right = new int[n];
+        int[] st = new int[n];
         int top = -1;
         for (int i = 0; i < n; i++) {
             int num = nums[i];
@@ -28,7 +30,9 @@ private long solve(int[] nums, int k) {
         }
         long ans = 0;
         for (int i = 0; i < n; i++) {
-            int num = nums[i], l = Math.min(i - left[i], k), r = Math.min(right[i] - i, k);
+            int num = nums[i];
+            int l = Math.min(i - left[i], k);
+            int r = Math.min(right[i] - i, k);
             if (l + r - 1 <= k) {
                 ans += (long) num * l * r;
             } else {