Skip to content

Commit 7600231

Browse files
committed
Rename right to left
1 parent 5f4bb16 commit 7600231

File tree

2 files changed

+8
-8
lines changed

2 files changed

+8
-8
lines changed

src/main/java/com/packt/datastructuresandalg/lesson5/activity/badcharacterrule/BadCharacterRule.java

+3-3
Original file line numberDiff line numberDiff line change
@@ -9,16 +9,16 @@ public List<Integer> match(String P, String T) {
99
int m = P.length();
1010

1111
int e = 256;
12-
int right[][] = new int[m][e];
13-
// Populate right[][] with the correct values
12+
int left[][] = new int[m][e];
13+
// Populate left[][] with the correct values
1414

1515
List<Integer> shifts = new ArrayList<>();
1616
int skip;
1717
for (int i = 0; i < n - m + 1; i += skip) {
1818
skip = 0;
1919
for (int j = m - 1; j >= 0; j--) {
2020
if (P.charAt(j) != T.charAt(i + j)) {
21-
skip = Math.max(1, j - right[j][T.charAt(i + j)]);
21+
skip = Math.max(1, j - left[j][T.charAt(i + j)]);
2222
break;
2323
}
2424
}

src/main/java/com/packt/datastructuresandalg/lesson5/activity/badcharacterrule/solution/BadCharacterRule.java

+5-5
Original file line numberDiff line numberDiff line change
@@ -9,15 +9,15 @@ public List<Integer> match(String P, String T) {
99
int m = P.length();
1010

1111
int e = 256;
12-
int right[][] = new int[m][e];
12+
int left[][] = new int[m][e];
1313
for (int i = 0; i < m; i++)
1414
for (int j = 0; j < e; j++)
15-
right[i][j] = -1;
15+
left[i][j] = -1;
1616
for (int i = 0; i < m; i++) {
1717
if (i != 0)
1818
for (int j = 0; j < e; j++)
19-
right[i][j] = right[i - 1][j];
20-
right[i][P.charAt(i)] = i;
19+
left[i][j] = left[i - 1][j];
20+
left[i][P.charAt(i)] = i;
2121
}
2222

2323
List<Integer> shifts = new ArrayList<>();
@@ -26,7 +26,7 @@ public List<Integer> match(String P, String T) {
2626
skip = 0;
2727
for (int j = m - 1; j >= 0; j--) {
2828
if (P.charAt(j) != T.charAt(i + j)) {
29-
skip = Math.max(1, j - right[j][T.charAt(i + j)]);
29+
skip = Math.max(1, j - left[j][T.charAt(i + j)]);
3030
break;
3131
}
3232
}

0 commit comments

Comments
 (0)