leetcode 45：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.)

不知道这算是贪心还是动态规划，应该是贪心吧

//参考 https://github.com/soulmachine/leetcode
int max(int a , int b){
    return a > b ? a : b ;
}

int jump(int* nums, int numsSize) {
    int maxReach=0;//站在[0,i]区间里面跳一步可以到达的最远距离
    int curReach=0;//目前跳ret步，可以到达的长度
    int ret=0;
	for (int i = 0; i < numsSize; i++)
	{
		if(curReach
   
   
    
    =numsSize-1)
            return ret;
	}
	return 0;
}

// LeetCode, Jump Game II
// 时间复杂度O(n)，空间复杂度O(1)
class Solution {
public:
    int jump(int A[], int n) {
        int step = 0; // 最小步数
        int left = 0;
        int right = 0; // [left, right] 是当前能覆盖的区间
        if (n == 1) return 0;
        while (left <= right) { // 尝试从每一层跳最远
            ++step;//在[left, right]区间 跳一步
            const int old_right = right;
            // 跳着一步最大可能跳到的区间
            for (int i = left; i <= old_right; ++i) {
                int new_right = i + A[i];
                if (new_right >= n - 1) return step;
                if (new_right > right) right = new_right;
            }
            left = old_right + 1;
        }
        return 0;
    }
};
   
   

动态规划这个会超时，注意 ：memeset 是以 字节为单位赋值，而代码中用的是int 类型 4个字节

// 动态规划
int jump(int* nums, int numsSize) {
    int *pStepFlags = (int *)malloc(numsSize*sizeof(int)); // 到 i 最少跳多少步
	pStepFlags[0] = 0;
	memset(pStepFlags + 1, 0x7f, (numsSize - 1)*sizeof(int));

	for (int i = 1; i
    
    
     
     = i &&  StepCount < pStepFlags[i])
			{
				pStepFlags[i] = StepCount;
				break;// 不要再循环了，前面的一定比后面的步数少！！！！Each element in the array represents your maximum jump length at that position，因为每个序列表示最大可以跳的距离，可以少跳
			}
		}
	}
	return pStepFlags[numsSize - 1];
}