漢諾塔遞迴演算法

標籤：依次   +=   ret   pre   輸出   time   移動   coding   oba   

# -*- coding:utf-8 -*-# author : Keekuun"""有三根杆子A，B，C。A杆上有N個(N>1)穿孔圓盤，盤的尺寸由下到上依次變小。要求按下列規則將所有圓盤移至C杆：每次只能移動一個圓盤；大盤不能疊在小盤上面。"""time = 0def mov(n, a, b, c):    global time    # 當只有一個圓盤時    if n == 1:        print(a, ‘-->‘, b)        time += 1    # 當有n個圓盤時    else:        # n = (n-1)+1,先移動n-1個圓盤到B        mov(n - 1, a, c, b)        # 把最大的圓盤1直接移到C        mov(1, a, b, c)        # 再把n-1個圓盤從B移到C        mov(n - 1, b, a, c)    return timeprint(mov(1, ‘A‘, ‘B‘, ‘C‘))print(‘*‘*10)print(mov(2, ‘A‘, ‘B‘, ‘C‘))print(‘*‘*10)print(mov(3, ‘A‘, ‘B‘, ‘C‘))print(‘*‘*10)print(mov(4, ‘A‘, ‘B‘, ‘C‘))

　　輸出

A --> B
1
**********
A --> C
A --> B
B --> A
4
**********
A --> B
A --> C
C --> A
A --> B
B --> C
B --> A
A --> B
11
**********
A --> C
A --> B
B --> A
A --> C
C --> B
C --> A
A --> C
A --> B
B --> A
B --> C
C --> B
B --> A
A --> C
A --> B
B --> A
26

 

漢諾塔遞迴演算法