Number of Ways to Stay in the Same Place After Some Steps

You have a pointer at index 0 in an array of size arrLen. At each step, you can move 1 position to the left, 1 position to the right in the array or stay in the same place  (The pointer should not be placed outside the array at any time).

Given two integers steps and arrLen, return the number of ways such that your pointer still at index 0 after exactly steps steps.

Since the answer may be too large, return it modulo 10^9 + 7.

Example 1:

Input: steps = 3, arrLen = 2
Output: 4
Explanation: There are 4 differents ways to stay at index 0 after 3 steps.
Right, Left, Stay
Stay, Right, Left
Right, Stay, Left
Stay, Stay, Stay

Example 2:

Input: steps = 2, arrLen = 4
Output: 2
Explanation: There are 2 differents ways to stay at index 0 after 2 steps
Right, Left
Stay, Stay

Example 3:

Input: steps = 4, arrLen = 2
Output: 8

Constraints:

• 1 <= steps <= 500
• 1 <= arrLen <= 10^6

思路：还是由最后一步得到，三种状态Right, left, stay三种状态最后一步得到最后status，i表示index，remain代表还剩下多少步，memo[i][j] 代表的是index为i的情况下，我还有remain步的情况下，总共可能的情况有多少种。如果，index > remainstep，肯定回不来直接return 0；base case是index == 0, remainstep == 0, return 1;

class Solution {
    int MOD = 1000000007;
    public int numWays(int steps, int arrLen) {
        long[][] cache = new long[steps + 1][steps + 1];
        return (int)dfs(cache, 0, steps, arrLen);
    }
    
    private long dfs(long[][] cache, int index, int remain, int arrLen) {
        // 一定不要忘记，i == 0, remain == 0的时候，返回1，代表就这一种状态；不用走了
        if(index == 0 && remain == 0) {
            return 1;
        }
        if(index < 0 || index >= arrLen || index > remain || remain < 0) {
            return 0;
        }
        if(cache[index][remain] != 0) {
            return cache[index][remain];
        }
        long value = 0;
        value = (dfs(cache, index + 1, remain - 1, arrLen) % MOD +
                dfs(cache, index, remain - 1, arrLen) % MOD +
                dfs(cache, index - 1, remain - 1, arrLen) % MOD ) % MOD;
        cache[index][remain] = value;
        return cache[index][remain];
    }
}