Rename right to left in BoyerMoore implementation

Author: jcazevedo

src/main/java/com/packt/datastructuresandalg/lesson5/activity/boyermoore/solution/BoyerMoore.java

@@ -9,15 +9,15 @@ public List<Integer> match(String P, String T) {
         int m = P.length();
 
         int e = 256;
-        int right[][] = new int[m][e];
+        int left[][] = new int[m][e];
         for (int i = 0; i < m; i++)
             for (int j = 0; j < e; j++)
-                right[i][j] = -1;
+                left[i][j] = -1;
         for (int i = 0; i < m; i++) {
             if (i != 0)
                 for (int j = 0; j < e; j++)
-                    right[i][j] = right[i - 1][j];
-            right[i][P.charAt(i)] = i;
+                    left[i][j] = left[i - 1][j];
+            left[i][P.charAt(i)] = i;
         }
 
         int i = m, j = m + 1;
@@ -50,7 +50,7 @@ public List<Integer> match(String P, String T) {
             for (j = m - 1; j >= 0; j--) {
                 if (P.charAt(j) != T.charAt(i + j)) {
                     hasMatch = false;
-                    skip = Math.max(s[j + 1], j - right[j][T.charAt(i + j)]);
+                    skip = Math.max(s[j + 1], j - left[j][T.charAt(i + j)]);
                     break;
                 }
             }