codes updated.

Author: liuyubobobo

05-Maze-Solver/Chapter-04-Completed-Codes/BFS-Maze-Solver/maze_101_101.txt renamed to 05-Maze-Solver/Chapter-05-Completed-Codes/BFS-Maze-Solver/maze_101_101.txt

@@ -0,0 +1,73 @@
+
+public class NaiveShuffle1 {
+
+    private int N;
+    private int n, m;
+
+    public NaiveShuffle1(int N, int n, int m){
+
+        if(N <= 0)
+            throw new IllegalArgumentException("N must be larger than 0!");
+
+        if(n < m)
+            throw new IllegalArgumentException("n must be larger than or equal to m!");
+
+        this.N = N;
+        this.n = n;
+        this.m = m;
+    }
+
+    public void run(){
+
+        int freq[] = new int[n];
+
+        int arr[] = new int[n];
+        for(int i = 0 ; i < N ; i ++){
+
+            reset(arr);
+            shuffle(arr);
+            for(int j = 0 ; j < n ; j ++)
+                freq[j] += arr[j];
+        }
+
+        for(int i = 0 ; i < n ; i ++){
+            System.out.println(i + " : " + (double)freq[i]/N);
+        }
+    }
+
+    private void reset(int[] arr){
+
+        for(int i = 0 ; i < m ; i ++)
+            arr[i] = 1;
+
+        for(int i = m ; i < n ; i ++)
+            arr[i] = 0;
+
+        return;
+    }
+
+    private void shuffle(int[] arr){
+
+        int swapTime = n;
+        for(int i = 0 ; i < swapTime ; i ++){
+            int x = (int)(Math.random() * n);
+            int y = (int)(Math.random() * n);
+            swap(arr, x, y);
+        }
+    }
+
+    private void swap(int[] arr, int x, int y){
+
+        int t = arr[x];
+        arr[x] = arr[y];
+        arr[y] = t;
+    }
+
+    public static void main(String[] args) {
+
+        int N = 10000000;
+        NaiveShuffle1 exp = new NaiveShuffle1(N, 10, 5);
+        exp.run();
+
+    }
+}

05-Maze-Solver/Chapter-04-Completed-Codes/BFS-Maze-Solver/src/AlgoFrame.java renamed to 05-Maze-Solver/Chapter-05-Completed-Codes/BFS-Maze-Solver/src/AlgoFrame.java

@@ -0,0 +1,76 @@
+
+public class NaiveShuffle2 {
+
+    private int N;
+    private int n, m;
+
+    public NaiveShuffle2(int N, int n, int m){
+
+        if(N <= 0)
+            throw new IllegalArgumentException("N must be larger than 0!");
+
+        if(n < m)
+            throw new IllegalArgumentException("n must be larger than or equal to m!");
+
+        this.N = N;
+        this.n = n;
+        this.m = m;
+    }
+
+    public void run(){
+
+        int freq[] = new int[n];
+
+        int arr[] = new int[n];
+        for(int i = 0 ; i < N ; i ++){
+
+            reset(arr);
+            shuffle(arr);
+            for(int j = 0 ; j < n ; j ++)
+                freq[j] += arr[j];
+        }
+
+        for(int i = 0 ; i < n ; i ++){
+            System.out.println(i + " : " + (double)freq[i]/N);
+        }
+    }
+
+    private void reset(int[] arr){
+
+        for(int i = 0 ; i < m ; i ++)
+            arr[i] = 1;
+
+        for(int i = m ; i < n ; i ++)
+            arr[i] = 0;
+
+        return;
+    }
+
+    private void shuffle(int[] arr){
+
+//        for(int i = 0 ; i < m ; i ++){
+//            int x = (int)(Math.random() * n);
+//            swap(arr, i, x);
+//        }
+
+        for(int i = 0 ; i < n ; i ++){
+            int x = (int)(Math.random() * n);
+            swap(arr, i, x);
+        }
+    }
+
+    private void swap(int[] arr, int x, int y){
+
+        int t = arr[x];
+        arr[x] = arr[y];
+        arr[y] = t;
+    }
+
+    public static void main(String[] args) {
+
+        int N = 10000000;
+        NaiveShuffle2 exp = new NaiveShuffle2(N, 10, 5);
+        exp.run();
+
+    }
+}

05-Maze-Solver/Chapter-04-Completed-Codes/BFS-Maze-Solver/src/AlgoVisHelper.java renamed to 05-Maze-Solver/Chapter-05-Completed-Codes/BFS-Maze-Solver/src/AlgoVisHelper.java

@@ -0,0 +1,78 @@
+
+public class KnuthShuffle {
+
+    private int N;
+    private int n, m;
+
+    public KnuthShuffle(int N, int n, int m){
+
+        if(N <= 0)
+            throw new IllegalArgumentException("N must be larger than 0!");
+
+        if(n < m)
+            throw new IllegalArgumentException("n must be larger than or equal to m!");
+
+        this.N = N;
+        this.n = n;
+        this.m = m;
+    }
+
+    public void run(){
+
+        int freq[] = new int[n];
+
+        int arr[] = new int[n];
+        for(int i = 0 ; i < N ; i ++){
+
+            reset(arr);
+            shuffle(arr);
+            for(int j = 0 ; j < n ; j ++)
+                freq[j] += arr[j];
+        }
+
+        for(int i = 0 ; i < n ; i ++){
+            System.out.println(i + " : " + (double)freq[i]/N);
+        }
+    }
+
+    private void reset(int[] arr){
+
+        for(int i = 0 ; i < m ; i ++)
+            arr[i] = 1;
+
+        for(int i = m ; i < n ; i ++)
+            arr[i] = 0;
+
+        return;
+    }
+
+    private void shuffle(int[] arr){
+
+        // 写法 1
+//        for(int i = 0 ; i < n ; i ++){
+//            int x = (int)(Math.random() * (n-i)) + i;
+//            swap(arr, i, x);
+//        }
+
+        // 写法 2
+        for(int i = n - 1 ; i >= 0 ; i --){
+            int x = (int)(Math.random() * (i+1));
+            swap(arr, i, x);
+        }
+    }
+
+    private void swap(int[] arr, int x, int y){
+
+        int t = arr[x];
+        arr[x] = arr[y];
+        arr[y] = t;
+    }
+
+    public static void main(String[] args) {
+
+        int N = 10000000;
+        KnuthShuffle exp = new KnuthShuffle(N, 10, 5);
+        exp.run();
+
+    }
+}

05-Maze-Solver/Chapter-04-Completed-Codes/BFS-Maze-Solver/src/AlgoVisualizer.java renamed to 05-Maze-Solver/Chapter-05-Completed-Codes/BFS-Maze-Solver/src/AlgoVisualizer.java

@@ -86,7 +86,7 @@ else if(SwingUtilities.isRightMouseButton(event))
     public static void main(String[] args) {
 
         int N = 20;
-        int M = 30;
+        int M = 20;
         int mineNumber = 20;
 
         AlgoVisualizer vis = new AlgoVisualizer(N, M, mineNumber);