Navigation :

a star

Title	Summary
Week 4 編程作業:8 Puzzle coursera Algorithms, Part I algorithm priority queue a star	編程作業: 8 Puzzle 只有99分 Board.java import java.util.ArrayList; import java.util.Arrays; import java.util.List; public class Board { private final short[] blocks; private final int n; private int i0; private int hamming; private int manhattan; private long hash; public Board(int[][] blocks) { this(blocks.length, copy(blocks)); } private Board(int n, short[] blocks) { this.blocks = Arrays.copyOf(blocks, blocks.length); this.n = n; this.hash = 0; for (int i = 0; i < blocks.length; i++) { if (this.

Title

Summary

Week 4 編程作業:8 Puzzle

coursera Algorithms, Part I algorithm priority queue a star

編程作業: 8 Puzzle 只有99分 Board.java import java.util.ArrayList; import java.util.Arrays; import java.util.List; public class Board { private final short[] blocks; private final int n; private int i0; private int hamming; private int manhattan; private long hash; public Board(int[][] blocks) { this(blocks.length, copy(blocks)); } private Board(int n, short[] blocks) { this.blocks = Arrays.copyOf(blocks, blocks.length); this.n = n; this.hash = 0; for (int i = 0; i < blocks.length; i++) { if (this.