class Solution {
public:
int jump(int A[], int n) {
vector<int>dp(n,0);
for(int i=0;i<n;i++)
{
int reach=min(i+A[i],n-1);
for(int j=i+1;j<=reach;j++)
if(dp[j]==0)dp[j]=dp[i]+1;
if(dp[n-1]!=0)break;
}
return dp[n-1];
}
};
https://leetcode.com/problems/jump-game-ii/#/description
题目链接 https://leetcode.com/problems/jump-game-ii/descripti...
链接：https://leetcode-cn.com/problems/jump-game-ii/descript...
原文地址http://www.lintcode.com/problem/jump-game-ii/Given an...
题目描述 https://leetcode-cn.com/problems/jump-game-ii/ 解 思路 ...
题目地址 https://leetcode.com/problems/jump-game-ii/descripti...
原题 https://leetcode-cn.com/problems/jump-game-ii/ 解题思路 使用...
题目地址： https://leetcode-cn.com/problems/jump-game-ii/[htt...
https://leetcode.com/problems/jump-game-ii/给定一个数组nums，数组内...
本文标题：jump-game-ii
本文链接：https://www.haomeiwen.com/subject/eqrdlctx.html
网友评论