原题:https://leetcode-cn.com/problems/deep-dark-fraction/
思路:
迭代的思想,每次交换分子和分母,分子 += cont[i] * 分母
代码:
class Solution {
public:
vector<int> fraction(vector<int>& cont) {
vector<int> r = {cont[cont.size()-1],1};
for(int i = cont.size()-2;i>=0;i--){
swap(r[0],r[1]);
r[0] += cont[i]*r[1];
}
return r;
}
};