矩阵分解 class Solution { static final int MOD = 1000000007; public int fib(int n) { if (n < 2) { return n; } int[][] q = { { 1, 1}, { 1, 0}}; int[][] res =