漢諾塔問題-----python實現

代碼部分： def hanoi(n,source,target,helper): if n==1: print(source+'->'+target) else: hanoi(n-1,source,helper,target) print(source+'->'+target) hanoi(n-1,helper,tar

>>阅读原文<<