mirror of
https://github.com/krahets/hello-algo.git
synced 2026-11-10 16:00:36 +08:00
14c314c08c
* Retranslate the complete English edition from Simplified Chinese * Polish three English explanations after reader-focused review
53 lines
1.4 KiB
JavaScript
53 lines
1.4 KiB
JavaScript
/**
|
|
* File: hanota.js
|
|
* Created Time: 2023-07-30
|
|
* Author: yuan0221 (yl1452491917@gmail.com)
|
|
*/
|
|
|
|
/* Move one disk */
|
|
function move(src, tar) {
|
|
// Take a disk from the top of src
|
|
const pan = src.pop();
|
|
// Place the disk on top of tar
|
|
tar.push(pan);
|
|
}
|
|
|
|
/* Solve the Tower of Hanoi problem f(i) */
|
|
function dfs(i, src, buf, tar) {
|
|
// If only one disk remains to be moved from src, move it directly to tar
|
|
if (i === 1) {
|
|
move(src, tar);
|
|
return;
|
|
}
|
|
// Subproblem f(i-1): move the top i-1 disks from src to buf using tar
|
|
dfs(i - 1, src, tar, buf);
|
|
// Subproblem f(1): move the remaining disk of this subproblem from src to tar
|
|
move(src, tar);
|
|
// Subproblem f(i-1): move the top i-1 disks from buf to tar using src
|
|
dfs(i - 1, buf, src, tar);
|
|
}
|
|
|
|
/* Solve the Tower of Hanoi problem */
|
|
function solveHanota(A, B, C) {
|
|
const n = A.length;
|
|
// Move the top n disks from A to C using B
|
|
dfs(n, A, B, C);
|
|
}
|
|
|
|
/* Driver code */
|
|
// The end of each list represents the top of the peg
|
|
const A = [5, 4, 3, 2, 1];
|
|
const B = [];
|
|
const C = [];
|
|
console.log('Initial state:');
|
|
console.log(`A = ${JSON.stringify(A)}`);
|
|
console.log(`B = ${JSON.stringify(B)}`);
|
|
console.log(`C = ${JSON.stringify(C)}`);
|
|
|
|
solveHanota(A, B, C);
|
|
|
|
console.log('After moving the disks:');
|
|
console.log(`A = ${JSON.stringify(A)}`);
|
|
console.log(`B = ${JSON.stringify(B)}`);
|
|
console.log(`C = ${JSON.stringify(C)}`);
|