class Solution {
public:
void hanota(vector<int>& A, vector<int>& B, vector<int>& C) {
int n = A.size();
move(n, A, B, C);
return;
}
void move(int n, vector<int>& A, vector<int>& B, vector<int>& C) {
if (n == 1) {
C.push_back(A.back());
A.pop_back();
return;
}
move(n - 1, A, C, B);
C.push_back(A.back());
A.pop_back();
move(n - 1, B, A, C);
return;
}
};
Leetcode 面试题 08.06.汉诺塔问题
最新推荐文章于 2024-06-18 16:57:59 发布