码迷,mamicode.com
首页 > 其他好文 > 详细

[LeetCode] Jump Game

时间:2015-02-25 21:03:31      阅读:101      评论:0      收藏:0      [点我收藏+]

标签:

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.

Determine if you are able to reach the last index.

For example:
A = [2,3,1,1,4], return true.

A = [3,2,1,0,4], return false.

 

解法:贪心算法。时间复杂度O(n), 空间复杂度O(1)

 1 class Solution {
 2 public:
 3     bool canJump(int A[], int n) {
 4         if (A == NULL || n <= 0) return false;
 5         
 6         int max_pos = 0;
 7         for (int i = 0; i <= max_pos && max_pos < n; ++i)
 8             max_pos = i + A[i] > max_pos ? i + A[i] : max_pos;
 9         
10         return max_pos >= n - 1;
11     }
12 };

 

[LeetCode] Jump Game

标签:

原文地址:http://www.cnblogs.com/vincently/p/4300057.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!