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时候的执行情况