题目:https://leetcode-cn.com/problems/deep-dark-fraction/
答案:找规律,归并
public int[] fraction(int[] cont) {
if(cont.length==1){
return new int[]{cont[0],1};
}else {
int m = cont[cont.length - 1];
int n = 1;
int tmp;
for (int i = cont.length - 2; i > 0; i--) {
tmp = m * cont[i] + n;
n = m;
m = tmp;
}
n = m * cont[0] + n;
return new int[]{n, m};
}
}