style: fix java cod

yanglbme · yanglbme · commit 1d4595f90ed1 · 2024-11-25T10:01:03.000+08:00
diff --git a/solution/3300-3399/3366.Minimum Array Sum/README.md b/solution/3300-3399/3366.Minimum Array Sum/README.md
@@ -161,7 +161,8 @@ class Solution {
                             f[i][j][k] = Math.min(f[i][j][k], f[i - 1][j - 1][k - 1] + (y - d));
                         }
                         if (x >= d) {
-                            f[i][j][k] = Math.min(f[i][j][k], f[i - 1][j - 1][k - 1] + (x - d + 1) / 2);
+                            f[i][j][k]
+                                = Math.min(f[i][j][k], f[i - 1][j - 1][k - 1] + (x - d + 1) / 2);
                         }
                     }
                 }
diff --git a/solution/3300-3399/3366.Minimum Array Sum/README_EN.md b/solution/3300-3399/3366.Minimum Array Sum/README_EN.md
@@ -158,7 +158,8 @@ class Solution {
                             f[i][j][k] = Math.min(f[i][j][k], f[i - 1][j - 1][k - 1] + (y - d));
                         }
                         if (x >= d) {
-                            f[i][j][k] = Math.min(f[i][j][k], f[i - 1][j - 1][k - 1] + (x - d + 1) / 2);
+                            f[i][j][k]
+                                = Math.min(f[i][j][k], f[i - 1][j - 1][k - 1] + (x - d + 1) / 2);
                         }
                     }
                 }
diff --git a/solution/3300-3399/3366.Minimum Array Sum/Solution.java b/solution/3300-3399/3366.Minimum Array Sum/Solution.java
@@ -26,7 +26,8 @@ public int minArraySum(int[] nums, int d, int op1, int op2) {
                             f[i][j][k] = Math.min(f[i][j][k], f[i - 1][j - 1][k - 1] + (y - d));
                         }
                         if (x >= d) {
-                            f[i][j][k] = Math.min(f[i][j][k], f[i - 1][j - 1][k - 1] + (x - d + 1) / 2);
+                            f[i][j][k]
+                                = Math.min(f[i][j][k], f[i - 1][j - 1][k - 1] + (x - d + 1) / 2);
                         }
                     }
                 }

Original file line number	Diff line number	Diff line change
`@@ -161,7 +161,8 @@ class Solution {`
`161`	`161`	`f[i][j][k] = Math.min(f[i][j][k], f[i - 1][j - 1][k - 1] + (y - d));`
`162`	`162`	`}`
`163`	`163`	`if (x >= d) {`
`164`		`- f[i][j][k] = Math.min(f[i][j][k], f[i - 1][j - 1][k - 1] + (x - d + 1) / 2);`
	`164`	`+ f[i][j][k]`
	`165`	`+ = Math.min(f[i][j][k], f[i - 1][j - 1][k - 1] + (x - d + 1) / 2);`
`165`	`166`	`}`
`166`	`167`	`}`
`167`	`168`	`}`
Original file line number	Diff line number	Diff line change
`@@ -158,7 +158,8 @@ class Solution {`
`158`	`158`	`f[i][j][k] = Math.min(f[i][j][k], f[i - 1][j - 1][k - 1] + (y - d));`
`159`	`159`	`}`
`160`	`160`	`if (x >= d) {`
`161`		`- f[i][j][k] = Math.min(f[i][j][k], f[i - 1][j - 1][k - 1] + (x - d + 1) / 2);`
	`161`	`+ f[i][j][k]`
	`162`	`+ = Math.min(f[i][j][k], f[i - 1][j - 1][k - 1] + (x - d + 1) / 2);`
`162`	`163`	`}`
`163`	`164`	`}`
`164`	`165`	`}`
Original file line number	Diff line number	Diff line change
`@@ -26,7 +26,8 @@ public int minArraySum(int[] nums, int d, int op1, int op2) {`
`26`	`26`	`f[i][j][k] = Math.min(f[i][j][k], f[i - 1][j - 1][k - 1] + (y - d));`
`27`	`27`	`}`
`28`	`28`	`if (x >= d) {`
`29`		`- f[i][j][k] = Math.min(f[i][j][k], f[i - 1][j - 1][k - 1] + (x - d + 1) / 2);`
	`29`	`+ f[i][j][k]`
	`30`	`+ = Math.min(f[i][j][k], f[i - 1][j - 1][k - 1] + (x - d + 1) / 2);`
`30`	`31`	`}`
`31`	`32`	`}`
`32`	`33`	`}`