标签：style blog io ar color os sp for on
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.)
C++代码实现：
#include<iostream> using namespace std; class Solution { public: int jump(int A[],int n) { int count=0; int maxSum=0; int sum=0; int reach=0; int i; for(i=0; i<=maxSum&&i<n; i++) { if(i>reach) { count++; reach=maxSum; } sum=i+A[i]; if(sum>maxSum) { maxSum=sum; } } if(maxSum>=n-1) return count; return 0; } }; int main() { Solution s; int A[15]= {7,0,9,6,9,6,1,7,9,0,1,2,9,0,3}; cout<<s.jump(A,15)<<endl; }
标签：style blog io ar color os sp for on
原文地址：http://www.cnblogs.com/wuchanming/p/4117199.html
