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.)

此次犯了一个大错误，导致结果一直出不来很郁闷。后来断点下，再度娘下，终于发现了，memset的用法错误。以前只是初始化0，不会有问题，现在用来初始化大int的值出错，原因是按字节初始化！以后记住！

 //dp 问题 ，dp[i] = min(dp[j])+1;(0<=j<i , 满足条件a[j]+j > i的情况（即能覆盖i） ) //dp[i] 为0-i的的最少步数
    int jump_game(int *a,int n)
    {
    	if (a == NULL || n <= 0)
    	{
    		return 0;
    	}
    
    	int *count = new int [n]; 
    
    	//memset(count,0,sizeof(int)*n);//初始化0可以。其他值不行，因是按字节赋值
    	
    	count[0] = 0;
    	for (int i = 1 ;i < n ;i++)
    	{
    		count[i]= INT_MAX;
    	}
    
    	for (int i = 1; i < n;i++)
    	{
    		 for (int j = 0;j < i ;j++)
    		 {
    			 if (a[j] + j >= i)//覆盖范围！！
    			 {
    				 if (count[i] > count[j]+1)
    				 {
    					 count[i] = count[j]+1; 
    					 //可优化！否则超时！！
    					break;
    				 }
    			 }
    		 }
    	}
    
    	 
    	int res = count[n-1];
    	delete []count;
    	return  res;
    }