success

Ladder

public class Solution {
    public int[] solution(int[] A, int[] B) {
        int n = A.length;
        int[] ladder = new int[n + 1];
        ladder[0] = ladder[1] = 1;
        for (int i = 2; i <= n; i++) {
            ladder[i] = ladder[i - 1] + ladder[i - 2];
        }
        for (int i = 0; i < n; i++) {
            A[i] = ladder[A[i]] & ((1 << B[i]) - 1);
        }
        return A;
    }


}