add checker

Sitrone · Sitrone · commit 6b035af271b2 · 2017-01-11T22:16:09.000+08:00
diff --git a/Algorithms 4/Part Ⅰ/week 4/hw/PuzzleChecker.java b/Algorithms 4/Part Ⅰ/week 4/hw/PuzzleChecker.java
@@ -0,0 +1,56 @@
+package com.algs4.hw4;
+
+/******************************************************************************
+ *  Compilation:  javac PuzzleChecker.java
+ *  Execution:    java PuzzleChecker filename1.txt filename2.txt ...
+ *  Dependencies: Board.java Solver.java
+ *
+ *  This program creates an initial board from each filename specified
+ *  on the command line and finds the minimum number of moves to
+ *  reach the goal state.
+ *
+ *  % java PuzzleChecker puzzle*.txt
+ *  puzzle00.txt: 0
+ *  puzzle01.txt: 1
+ *  puzzle02.txt: 2
+ *  puzzle03.txt: 3
+ *  puzzle04.txt: 4
+ *  puzzle05.txt: 5
+ *  puzzle06.txt: 6
+ *  ...
+ *  puzzle3x3-impossible: -1
+ *  ...
+ *  puzzle42.txt: 42
+ *  puzzle43.txt: 43
+ *  puzzle44.txt: 44
+ *  puzzle45.txt: 45
+ *
+ ******************************************************************************/
+
+import edu.princeton.cs.algs4.In;
+import edu.princeton.cs.algs4.StdOut;
+
+public class PuzzleChecker {
+
+    public static void main(String[] args) {
+
+        // for each command-line argument
+        for (String filename : args) {
+
+            // read in the board specified in the filename
+            In in = new In(filename);
+            int n = in.readInt();
+            int[][] tiles = new int[n][n];
+            for (int i = 0; i < n; i++) {
+                for (int j = 0; j < n; j++) {
+                    tiles[i][j] = in.readInt();
+                }
+            }
+
+            // solve the slider puzzle
+            Board initial = new Board(tiles);
+            Solver solver = new Solver(initial);
+            StdOut.println(filename + ": " + solver.moves());
+        }
+    }
+}
