Fundamental Algorithms Analysis (005)-Hanoi Tower【汉诺塔】
HanoiTower关于汉诺塔的问题描述已经人尽皆知了,在此便不再赘述。汉诺塔问题是一个经典的递归案列。Hanoitowerrecursivemethodvoidhanoi(intplates,vector&A,vector&B,vector&C){//position:A->C,Bistemporarystateif(plates==1)(C.push_back(A.back()),A.pop_