Hard

Number of ZigZag Arrays IIPython

Full explanation · Time O((r - l)^3 * logn) · Space O((r - l)^2)

# Time:  O((r - l)^3 * logn)
# Space: O((r - l)^2)

import itertools


# matrix fast exponentiation
class Solution(object):
    def zigZagArrays(self, n, l, r):
        """
        :type n: int
        :type l: int
        :type r: int
        :rtype: int
        """
        MOD = 10**9+7
        def matrix_mult(A, B):
            ZB = zip(*B)
            return [[sum(a*b % MOD for a, b in itertools.izip(row, col)) % MOD for col in ZB] for row in A]
 
        def matrix_expo(A, K):
            result = [[int(i == j) for j in xrange(len(A))] for i in xrange(len(A))]
            while K:
                if K % 2:
                    result = matrix_mult(result, A)
                A = matrix_mult(A, A)
                K /= 2
            return result
    
        r -= l
        matrix = [[int(i+j < r) for j in xrange(r+1)] for i in xrange(r+1)]
        matrix_pow_t = matrix_expo(matrix, n-1)
        return (reduce(lambda accu, x: (accu+x)%MOD, matrix_mult([[1]*(r+1)], matrix_pow_t)[0], 0)*2)%MOD