LeetCode 45. Jump Game II (Greedy 贪心算法）C++

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.

给定一个非负整数数组，你最初位于数组的第一个位置。
数组中的每个元素代表你在该位置可以跳跃的最大长度。
你的目标是使用最少的跳跃次数到达数组的最后一个位置。

Example:

Input: [2,3,1,1,4]
Output: 2
Explanation: 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.

Note:
You can assume that you can always reach the last index.

说明:
假设你总是可以到达数组的最后一个位置。

C++

//Greedy
class Solution{
public:
	int jump(vector<int>& nums){
		int maxpos = 0, end = 0, step = 0, n = nums.size();
		for(int i = 0; i < n - 1; i++){
			maxpos = max(maxpos,nums[i] + i);
			if(i == end){//i碰到边界，更新边界，并且step + 1
				step++;
				end = maxpos;
			}
		}
		return step;
	}
};

参考: 45. 跳跃游戏 II