注意模拟思路!a+n/m=(m*a+n)/m,再取倒数之后,对应迭代方式为:m=m*a+n, n=m.
class Solution {
public:
vector<int> fraction(vector<int>& cont) {
reverse(cont.begin(),cont.end());
int len=cont.size();
int m=1,n=0;
for(int i=0;i<len;i++)
{
int tmp=m;
m=m*cont[i]+n;
n=tmp;
}
return {m, n};
}
};