Rust數據結構和算法系列[2]-漢諾塔

//這個沒什麼好說的，很簡單的遞歸
//fromPole : 起點柱，withPole：中間柱,toPole：目標柱
fn moveTower(height:i32,fromPole : &str,withPole:&str,toPole:&str){
    if height >=1{
        //第一步，從起點柱，經由目標柱，放到中間柱
        moveTower(height-1, fromPole,toPole, withPole); 
        //第二步，從起點柱，放到目標柱
        moveDisk(height, fromPole, toPole);
        //第三步，從中間柱，經由起點柱，放到目標柱
        moveTower(height-1, withPole, fromPole, toPole);
    }
}
fn moveDisk(disk:i32,fromPole:&str,toPole:&str){
    println!("Moving disk[{}] from {} to {}",disk,fromPole,toPole);
}
pub fn run(n:i32)
{
    moveTower(n, "#1", "#2", "#3");
}

以下是當有n=5時候的執行情況