leetcode之Jump Game
来源:互联网 发布:特效视频制作软件 编辑:程序博客网 时间:2024/06/05 22:30
原题如下:
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
.
class Solution {public: bool canJump(int A[], int n) {if(n == 1)return true; if( A[0] == 0 && n > 1)return false;int max = A[0];int i = 1;for(i = 1; i < n; i++){int temp = A[i] + i;max = (max > temp ? max : temp);if(max <= i && i != n-1)//如果当前节点不是最后一个节点且最大步长到不了下一个节点则返回falsereturn false;}return true; }};
0 0
- LeetCode 之 Jump Game
- leetcode之Jump Game
- leetcode 之 Jump Game
- LeetCode之Jump Game
- Leetcode 之 Jump Game
- leetcode之jump game
- leetcode之Jump Game
- 【Leetcode】之 Jump Game
- leetcode之Jump Game && Jump Game II
- Leetcode之Jump Game & Jump Game II
- LeetCode之Jump Game II
- 【Leetcode】之Jump Game II
- leetcode之jump game II
- Leetcode之Jump Game问题
- LeetCode 之 Jump Game(贪心算法)
- LeetCode第45之 Jump Game II
- LeetCode进阶之路( Jump Game)
- Leetcode之Jump Game II 问题
- 返回值的第二个作用
- 用TI CC2530DK开发时,用light swtich例子会遇到的一个问题和解决方案
- How to diff and merge files or directories on Linux
- Ubuntu 12.04中文输入法的安装
- 基础数位DP小结
- leetcode之Jump Game
- HDU 2838 (树状数组求逆序数)
- 关于fork 创建进程
- snprintf函数的常见功能
- 【LeetCode】Merge k Sorted Lists
- Matlab中kmeans聚类用法
- 商城放大镜效果
- mysql5.5.15配置主从数据库
- 使用protobuf定义消息