LCP 2-分式化简

Posted 2020-11-26 angelica-duhurica

LCP 2-分式化简

    public int[] fraction(int[] cont) {
        int len = cont.length;
        int[] d = new int[]{cont[len - 1], 1};
        while (len > 1) {
            d = get(cont[len - 2], d);
            len--;
        }

        return d;
    }

    private int[] get(int z, int[] c) {
        return new int[]{z * c[0] + c[1], c[0]};
    }

即

public int[] fraction(int[] cont) {
    int[] res = new int[2];
    res[0] = 1;
    for(int i = cont.length - 1; i >= 0; i--){
        int temp1 = res[1];
        res[1] = res[0];
        res[0] = cont[i] * res[1] + temp1;
    }
    return res;
}