You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
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 exactlysteps steps.
Since the answer may be too large, return it modulo10^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
Number of Ways to Stay in the Same Place After Some Steps
You have a pointer at index
0
in an array of sizearrLen
. 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
andarrLen
, return the number of ways such that your pointer still at index0
after exactlysteps
steps.Since the answer may be too large, return it modulo
10^9 + 7
.Example 1:
Example 2:
Example 3:
Constraints:
1 <= steps <= 500
1 <= arrLen <= 10^6
算法思路:利用动态规划的思想,设
dp[steps][len]
表示经过steps
步到达len
位置的方法的数量,dp[i][j] = dp[i - 1][j - 1] + dp[i -1][j] + dp[i + 1][j - 1]
,且len <= steps + 1
,所以len
取steps + 1
和arrLen
中的较小值。The text was updated successfully, but these errors were encountered: