Skip to content

Commit bff0e1e

Browse files
authored
Update Solution.java
1 parent 5f7c2c6 commit bff0e1e

File tree

1 file changed

+0
-4
lines changed
  • src/main/java/g3001_3100/s3006_find_beautiful_indices_in_the_given_array_i

1 file changed

+0
-4
lines changed

Diff for: src/main/java/g3001_3100/s3006_find_beautiful_indices_in_the_given_array_i/Solution.java

-4
Original file line numberDiff line numberDiff line change
@@ -14,7 +14,6 @@ public List<Integer> beautifulIndices(String s, String a, String b, int q) {
1414
int[] lpsa = getLps(ac);
1515
int[] lpsb = getLps(bc);
1616
int mo;
17-
1817
int[] comp = new int[sc.length];
1918
int[] st = new int[sc.length];
2019
int si = 0;
@@ -52,7 +51,6 @@ public List<Integer> beautifulIndices(String s, String a, String b, int q) {
5251
if (si == 0) {
5352
return ret;
5453
}
55-
5654
if (sc[0] == ac[0]) {
5755
comp[0] = 1;
5856
if (ac.length == 1 && st[0] <= q) {
@@ -61,7 +59,6 @@ public List<Integer> beautifulIndices(String s, String a, String b, int q) {
6159
} else {
6260
comp[0] = 0;
6361
}
64-
6562
for (int i = 1; i < comp.length; i++) {
6663
mo++;
6764
if (sc[i] == ac[0]) {
@@ -92,7 +89,6 @@ public List<Integer> beautifulIndices(String s, String a, String b, int q) {
9289
}
9390
}
9491
}
95-
9692
return ret;
9793
}
9894

0 commit comments

Comments
 (0)