fix: code style

yanglbme · yanglbme · commit ccc3809b6860 · 2024-10-23T09:28:09.000+08:00
diff --git a/solution/3300-3399/3316.Find Maximum Removals From Source String/README.md b/solution/3300-3399/3316.Find Maximum Removals From Source String/README.md
@@ -162,7 +162,7 @@ class Solution {
         for (int i = 1; i <= m; ++i) {
             for (int j = 0; j <= n; ++j) {
                 f[i][j] = f[i - 1][j] + s[i - 1];
-                if (j >  0 && source.charAt(i - 1) == pattern.charAt(j - 1)) {
+                if (j > 0 && source.charAt(i - 1) == pattern.charAt(j - 1)) {
                     f[i][j] = Math.max(f[i][j], f[i - 1][j - 1]);
                 }
             }
diff --git a/solution/3300-3399/3316.Find Maximum Removals From Source String/README_EN.md b/solution/3300-3399/3316.Find Maximum Removals From Source String/README_EN.md
@@ -157,7 +157,7 @@ class Solution {
         for (int i = 1; i <= m; ++i) {
             for (int j = 0; j <= n; ++j) {
                 f[i][j] = f[i - 1][j] + s[i - 1];
-                if (j >  0 && source.charAt(i - 1) == pattern.charAt(j - 1)) {
+                if (j > 0 && source.charAt(i - 1) == pattern.charAt(j - 1)) {
                     f[i][j] = Math.max(f[i][j], f[i - 1][j - 1]);
                 }
             }
diff --git a/solution/3300-3399/3316.Find Maximum Removals From Source String/Solution.java b/solution/3300-3399/3316.Find Maximum Removals From Source String/Solution.java
@@ -14,7 +14,7 @@ public int maxRemovals(String source, String pattern, int[] targetIndices) {
         for (int i = 1; i <= m; ++i) {
             for (int j = 0; j <= n; ++j) {
                 f[i][j] = f[i - 1][j] + s[i - 1];
-                if (j >  0 && source.charAt(i - 1) == pattern.charAt(j - 1)) {
+                if (j > 0 && source.charAt(i - 1) == pattern.charAt(j - 1)) {
                     f[i][j] = Math.max(f[i][j], f[i - 1][j - 1]);
                 }
             }

Original file line number	Diff line number	Diff line change
`@@ -162,7 +162,7 @@ class Solution {`
`162`	`162`	`for (int i = 1; i <= m; ++i) {`
`163`	`163`	`for (int j = 0; j <= n; ++j) {`
`164`	`164`	`f[i][j] = f[i - 1][j] + s[i - 1];`
`165`		`- if (j > 0 && source.charAt(i - 1) == pattern.charAt(j - 1)) {`
	`165`	`+ if (j > 0 && source.charAt(i - 1) == pattern.charAt(j - 1)) {`
`166`	`166`	`f[i][j] = Math.max(f[i][j], f[i - 1][j - 1]);`
`167`	`167`	`}`
`168`	`168`	`}`
Original file line number	Diff line number	Diff line change
`@@ -157,7 +157,7 @@ class Solution {`
`157`	`157`	`for (int i = 1; i <= m; ++i) {`
`158`	`158`	`for (int j = 0; j <= n; ++j) {`
`159`	`159`	`f[i][j] = f[i - 1][j] + s[i - 1];`
`160`		`- if (j > 0 && source.charAt(i - 1) == pattern.charAt(j - 1)) {`
	`160`	`+ if (j > 0 && source.charAt(i - 1) == pattern.charAt(j - 1)) {`
`161`	`161`	`f[i][j] = Math.max(f[i][j], f[i - 1][j - 1]);`
`162`	`162`	`}`
`163`	`163`	`}`
Original file line number	Diff line number	Diff line change
`@@ -14,7 +14,7 @@ public int maxRemovals(String source, String pattern, int[] targetIndices) {`
`14`	`14`	`for (int i = 1; i <= m; ++i) {`
`15`	`15`	`for (int j = 0; j <= n; ++j) {`
`16`	`16`	`f[i][j] = f[i - 1][j] + s[i - 1];`
`17`		`- if (j > 0 && source.charAt(i - 1) == pattern.charAt(j - 1)) {`
	`17`	`+ if (j > 0 && source.charAt(i - 1) == pattern.charAt(j - 1)) {`
`18`	`18`	`f[i][j] = Math.max(f[i][j], f[i - 1][j - 1]);`
`19`	`19`	`}`
`20`	`20`	`}`