LeetCode 55. Jump Game
来源:互联网 发布:死亡代理人知乎 编辑:程序博客网 时间:2024/05/15 04:33
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(vector<int>& nums) { int start = 0,end = 0; while(end < nums.size()){ int max = 0; for(end = start;end < nums.size(); end ++){ if(nums[end] == 0) break; } if(end >= nums.size() -1) return true; for(int i = start; i < end; i ++){ int temp = nums[i] - (end - i); if(temp > max) max = temp; } if(max <= 0){ return false; } nums[end] = max; start = end; } return true; }};
0 0
- [LeetCode]55.Jump Game
- LeetCode 55.Jump Game
- LeetCode --- 55. Jump Game
- [Leetcode] 55. Jump Game
- [leetcode] 55.Jump Game
- [leetcode] 55.Jump Game
- *LeetCode 55. Jump Game
- LeetCode 55. Jump Game
- [leetcode] 55. Jump Game
- leetcode 55. Jump Game
- 55. Jump Game LeetCode
- 【LeetCode】55. Jump Game
- leetcode 55. Jump Game
- [LeetCode] 55. Jump Game
- LeetCode 55. Jump Game
- LeetCode *** 55. Jump Game
- Leetcode 55. Jump Game
- LeetCode-55.Jump Game
- Git服务器的搭建和基本使用
- 学习之路⊙0⊙→学习之路 CnBlogsHomeNew PostAdmin idea新建maven项目时,mvn archetype:generate 速度缓慢
- 详解C标准库中的atexit()函数
- CSS中后代选择器和子代选择器
- ghost博客主题更换
- LeetCode 55. Jump Game
- windows及linux下使用python多进程编程
- poj 2676 Sudoku(dfs)
- Linux学习篇------认识与学习bash
- salesforce CTI迁移(CTI Adapter --> Open CTI)
- http 方法状态便签
- Math.round()方法
- 使用boost库读写XML文件
- Java程序员开发参考资源