LeetCode刷题记录：剑指 Offer 10- I. 斐波那契数列

class Solution {
public:
    int fib(int n) {
    	if (n == 0 || n == 1) {
    		return n;
		}
    	
		vector<int> arr(n + 1);
		arr[0] = 0;
		arr[1] = 1;
		
		for (int i = 2; i < n + 1; i++) {
			arr[i] = (arr[i - 1] + arr[i - 2]) % 1000000007;
		}
		
		return arr[n];
    }
};