You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
55 lines
1.3 KiB
55 lines
1.3 KiB
7 months ago
|
/**
|
||
|
|
* File: hanota.dart
|
||
|
|
* Created Time: 2023-08-10
|
||
|
|
* Author: liuyuxin (gvenusleo@gmail.com)
|
||
|
|
*/
|
||
|
|
|
||
|
|
/* 移動一個圓盤 */
|
||
|
|
void move(List<int> src, List<int> tar) {
|
||
|
|
// 從 src 頂部拿出一個圓盤
|
||
|
|
int pan = src.removeLast();
|
||
|
|
// 將圓盤放入 tar 頂部
|
||
|
|
tar.add(pan);
|
||
|
|
}
|
||
|
|
|
||
|
|
/* 求解河內塔問題 f(i) */
|
||
|
|
void dfs(int i, List<int> src, List<int> buf, List<int> tar) {
|
||
|
|
// 若 src 只剩下一個圓盤，則直接將其移到 tar
|
||
|
|
if (i == 1) {
|
||
|
|
move(src, tar);
|
||
|
|
return;
|
||
|
|
}
|
||
|
|
// 子問題 f(i-1) ：將 src 頂部 i-1 個圓盤藉助 tar 移到 buf
|
||
|
|
dfs(i - 1, src, tar, buf);
|
||
|
|
// 子問題 f(1) ：將 src 剩餘一個圓盤移到 tar
|
||
|
|
move(src, tar);
|
||
|
|
// 子問題 f(i-1) ：將 buf 頂部 i-1 個圓盤藉助 src 移到 tar
|
||
|
|
dfs(i - 1, buf, src, tar);
|
||
|
|
}
|
||
|
|
|
||
|
|
/* 求解河內塔問題 */
|
||
|
|
void solveHanota(List<int> A, List<int> B, List<int> C) {
|
||
|
|
int n = A.length;
|
||
|
|
// 將 A 頂部 n 個圓盤藉助 B 移到 C
|
||
|
|
dfs(n, A, B, C);
|
||
|
|
}
|
||
|
|
|
||
|
|
/* Driver Code */
|
||
|
|
void main() {
|
||
|
|
// 串列尾部是柱子頂部
|
||
|
|
List<int> A = [5, 4, 3, 2, 1];
|
||
|
|
List<int> B = [];
|
||
|
|
List<int> C = [];
|
||
|
|
print("初始狀態下：");
|
||
|
|
print("A = $A");
|
||
|
|
print("B = $B");
|
||
|
|
print("C = $C");
|
||
|
|
|
||
|
|
solveHanota(A, B, C);
|
||
|
|
|
||
|
|
print("圓盤移動完成後：");
|
||
|
|
print("A = $A");
|
||
|
|
print("B = $B");
|
||
|
|
print("C = $C");
|
||
|
|
}
|