【leetcode】Jump Game II
2015-05-26 00:07
465 查看
Jump Game II
Given an array of non-negative integers, you are initially positioned at the first index of the array.Each element in the array represents your maximum jump length at that position.
Your goal is to reach the last index in the minimum number of jumps.
For example:
Given array A = [2,3,1,1,4]
The minimum number of jumps to reach the last index is 2. (Jump 1 step from index 0 to 1, then 3 steps to the last index.)
思路:
其实就是记录下走到当前位置的时候的最小步数,用cur记录当前位置可达的最大位置,last记录之前可以到达的最大位置。
class Solution { public: int jump(vector<int>& nums) { int n=nums.size(); if(n==0||n==1) return 0; if(nums[0]==0) return 0; int res=0; int cur=0,last=0; for(int i=0;i<n;i++) { if(last<i) { last=cur; res++; } cur=max(cur,i+nums[i]); } return res; } };
相关文章推荐
- leetcode || 45、 Jump Game II
- [LeetCode P45] Jump Game II
- 【LeetCode-45】Jump Game II
- [leetcode]Jump Game II @ Python
- LeetCode题目 Jump Game II
- LeetCode刷题笔记(贪心):jump-game-ii
- LeetCode Jump Game II
- Leetcode NO.45 Jump Game II
- LeetCode:Jump Game II
- leetcode jump game ii
- LeetCode 第四十五题(Jump Game II)Java
- LeetCode - Jump Game II
- Leetcode -- Jump Game II
- leetcode解题报告:45. Jump Game II
- [LeetCode 45] Jump Game II
- LEETCODE: Jump Game II
- LeetCode Jump Game && Jump GameII
- LeetCode Jump Game II
- [Leetcode] Jump Game II
- 【leetcode】45. Jump Game II