leetcode快乐刷题:汉诺塔问题

class Solution {
public:
 void hanot(int n,vector<int>&A,vector<int>&B,vector<int>&C)
 {
    if(1==n)
    {
       C.push_back(A.back());
       A.pop_back();
        return;
    }
    hanot(n-1,A,C,B);
    C.push_back(A.back());//将A中最后一个放入到C里
    A.pop_back();         //A中元素删除
    hanot(n-1,B,A,C);
 }
    void hanota(vector<int>& A, vector<int>& B, vector<int>& C) {
       if(A.size()==0)return ;
        hanot(A.size(),A,B,C);
    }
};