Fixed style.

javadev · web-flow · commit cbc059f21c35 · 2022-03-29T14:02:01.000+03:00
diff --git a/src/main/java/g1401_1500/s1465_maximum_area_of_a_piece_of_cake_after_horizontal_and_vertical_cuts/Solution.java b/src/main/java/g1401_1500/s1465_maximum_area_of_a_piece_of_cake_after_horizontal_and_vertical_cuts/Solution.java
@@ -14,14 +14,13 @@ public int maxArea(int h, int w, int[] horizontalCuts, int[] verticalCuts) {
             maxVertical = Math.max(maxVertical, diff);
         }
         maxVertical = Math.max(maxVertical, (long) w - verticalCuts[verticalCuts.length - 1]);
-        long max_horizontal = 0;
-        max_horizontal = Math.max(max_horizontal, horizontalCuts[0]);
+        long maxHorizontal = Math.max(0L, horizontalCuts[0]);
         for (int i = 1; i < horizontalCuts.length; i++) {
             int diff = (horizontalCuts[i] - horizontalCuts[i - 1]);
-            max_horizontal = Math.max(max_horizontal, diff);
+            maxHorizontal = Math.max(maxHorizontal, diff);
         }
-        max_horizontal =
-                Math.max(max_horizontal, (long) h - horizontalCuts[horizontalCuts.length - 1]);
-        return (int) (maxVertical % 1000000007 * max_horizontal % 1000000007) % 1000000007;
+        maxHorizontal =
+                Math.max(maxHorizontal, (long) h - horizontalCuts[horizontalCuts.length - 1]);
+        return (int) (maxVertical % 1000000007 * maxHorizontal % 1000000007) % 1000000007;
     }
 }
diff --git a/src/main/java/g1401_1500/s1467_probability_of_a_two_boxes_having_the_same_number_of_distinct_balls/Solution.java b/src/main/java/g1401_1500/s1467_probability_of_a_two_boxes_having_the_same_number_of_distinct_balls/Solution.java
@@ -7,7 +7,9 @@ public class Solution {
     public double getProbability(int[] balls) {
         int m = balls.length;
         int s = 0;
-        for (int b : balls) s += b;
+        for (int b : balls) {
+            s += b;
+        }
         double[][] c = new double[s + 1][s / 2 + 1];
         c[0][0] = 1;
         for (int i = 1; i < s + 1; i++) {

Original file line number	Diff line number	Diff line change
`@@ -14,14 +14,13 @@ public int maxArea(int h, int w, int[] horizontalCuts, int[] verticalCuts) {`
`14`	`14`	`maxVertical = Math.max(maxVertical, diff);`
`15`	`15`	`}`
`16`	`16`	`maxVertical = Math.max(maxVertical, (long) w - verticalCuts[verticalCuts.length - 1]);`
`17`		`- long max_horizontal = 0;`
`18`		`- max_horizontal = Math.max(max_horizontal, horizontalCuts[0]);`
	`17`	`+ long maxHorizontal = Math.max(0L, horizontalCuts[0]);`
`19`	`18`	`for (int i = 1; i < horizontalCuts.length; i++) {`
`20`	`19`	`int diff = (horizontalCuts[i] - horizontalCuts[i - 1]);`
`21`		`- max_horizontal = Math.max(max_horizontal, diff);`
	`20`	`+ maxHorizontal = Math.max(maxHorizontal, diff);`
`22`	`21`	`}`
`23`		`- max_horizontal =`
`24`		`- Math.max(max_horizontal, (long) h - horizontalCuts[horizontalCuts.length - 1]);`
`25`		`- return (int) (maxVertical % 1000000007 * max_horizontal % 1000000007) % 1000000007;`
	`22`	`+ maxHorizontal =`
	`23`	`+ Math.max(maxHorizontal, (long) h - horizontalCuts[horizontalCuts.length - 1]);`
	`24`	`+ return (int) (maxVertical % 1000000007 * maxHorizontal % 1000000007) % 1000000007;`
`26`	`25`	`}`
`27`	`26`	`}`