Solution to today's problem

src/main/java/io/github/spannm/leetcode/lc0/lc0700/Problem0787.java

@@ -9,12 +9,11 @@
  */
 public class Problem0787 extends LeetcodeProblem {
 
-    private static final int INF = 0x3f3f3f3f;
-
     public int findCheapestPrice(int _n, int[][] _flights, int _src, int _dst, int _k) {
+        int inf = 0x3f3f3f3f;
         int[] dist = new int[_n];
         int[] backup = new int[_n];
-        Arrays.fill(dist, INF);
+        Arrays.fill(dist, inf);
         dist[_src] = 0;
         for (int i = 0; i < _k + 1; i++) {
             System.arraycopy(dist, 0, backup, 0, _n);
@@ -25,7 +24,7 @@ public int findCheapestPrice(int _n, int[][] _flights, int _src, int _dst, int _
                 dist[t] = Math.min(dist[t], backup[f] + p);
             }
         }
-        return dist[_dst] == INF ? -1 : dist[_dst];
+        return dist[_dst] == inf ? -1 : dist[_dst];
     }
 
 }