forked from algorithm009-class01/algorithm009-class01
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSlidingPuzzle.java
More file actions
57 lines (53 loc) · 1.73 KB
/
SlidingPuzzle.java
File metadata and controls
57 lines (53 loc) · 1.73 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
package tree;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.Queue;
public class SlidingPuzzle {
public int slidingPuzzle(int[][] board){
String target = "123450";
String start = "";
for (int i = 0; i < board.length; i++) {
for (int j = 0; j < board[0].length; j++) {
start += board[i][j];
}
}
HashSet<String> visited = new HashSet<>();
int[][] dirs = new int[][]{{1,3},{0,2,4},{1,5},{0,4},{1,3,5},{2,4}};
Queue<String> queue = new LinkedList<>();
queue.offer(start);
visited.add(start);
int res = 0;
while (!queue.isEmpty()){
int size = queue.size();
for (int i = 0; i < size; i++) {
String cur = queue.poll();
if (cur.equals(target)){
return res;
}
int zero = cur.indexOf('0');
for (int dir : dirs[zero]){
String next = swap(cur,zero,dir);
if (visited.contains(next)){
continue;
}
visited.add(next);
queue.offer(next);
}
}
res++;
}
return -1;
}
private String swap(String str, int i, int j) {
StringBuilder sb = new StringBuilder(str);
sb.setCharAt(i,str.charAt(j));
sb.setCharAt(j,str.charAt(i));
return sb.toString();
}
public static void main(String[] args) {
int[][] board = {{4,1,2},{5,0,3}};
SlidingPuzzle slidingPuzzle = new SlidingPuzzle();
int r = slidingPuzzle.slidingPuzzle(board);
System.out.println(r);
}
}