update 2976

Author: fishercoder1534

Diff for: src/main/java/com/fishercoder/solutions/thirdthousand/_2976.java

@@ -16,9 +16,9 @@ public static class Solution1 {
          * the shortest path in a weighted (non-negative) graph.
          */
         public long minimumCost(String source, String target, char[] original, char[] changed, int[] cost) {
-            int ALPHABET_SIZE = 26;
-            List<int[]>[] graph = new ArrayList[ALPHABET_SIZE];
-            for (int i = 0; i < ALPHABET_SIZE; i++) {
+            int alphabetSize = 26;
+            List<int[]>[] graph = new ArrayList[alphabetSize];
+            for (int i = 0; i < alphabetSize; i++) {
                 graph[i] = new ArrayList<>();
             }
             for (int i = 0; i < original.length; i++) {