Fixed style

Author: javadev

src/main/java/g3101_3200/s3129_find_all_possible_stable_binary_arrays_i/Solution.java

@@ -25,7 +25,9 @@ public int numberOfStableArrays(int zero, int one, int limit) {
         int max = Math.max(zero, one);
         int min = Math.min(zero, one);
         int[][] lcn = new int[max + 1][max + 1];
-        int[] row0 = lcn[0], row1, row2;
+        int[] row0 = lcn[0];
+        int[] row1;
+        int[] row2;
         row0[0] = 1;
         for (int s = 1, sLim = s - limit; s <= max; s++, sLim++) {
             row2 = sLim > 0 ? lcn[sLim - 1] : null;

src/main/java/g3101_3200/s3130_find_all_possible_stable_binary_arrays_ii/Solution.java

@@ -5,7 +5,8 @@
 public class Solution {
     private static final int MOD = (int) 1e9 + 7;
     private static final int N = 1000;
-    private static long[] factorial, reverse;
+    private static long[] factorial;
+    private static long[] reverse;
 
     public int numberOfStableArrays(int zero, int one, int limit) {
         if (factorial == null) {
@@ -51,7 +52,8 @@ public long comb(int n, int k) {
 
     public long getInverse(long n, long mod) {
         long p = mod;
-        long x = 1, y = 0;
+        long x = 1;
+        long y = 0;
         while (p > 0) {
             long quotient = n / p;
             long remainder = n % p;

src/main/java/g3101_3200/s3133_minimum_array_end/Solution.java

@@ -12,7 +12,8 @@ public long minEnd(int n, int x) {
             xb[i] = (x >> i) & 1;
             nb[i] = (n >> i) & 1;
         }
-        int i = 0, j = 0;
+        int i = 0;
+        int j = 0;
         while (i < 64) {
             if (xb[i] != 1) {
                 xb[i] = nb[j++];

src/main/java/g3101_3200/s3134_find_the_median_of_the_uniqueness_array/Solution.java

@@ -27,7 +27,9 @@ public int medianOfUniquenessArray(int[] nums) {
     private boolean check(int[] nums, int max, int target, long k) {
         long count = 0;
         int distinct = 0;
-        int n = nums.length, left = 0, right = 0;
+        int n = nums.length;
+        int left = 0;
+        int right = 0;
         int[] freq = new int[max + 1];
         while (right < n) {
             int x = nums[right++];