leetcode---Jump Game---贪心
来源:互联网 发布:华为查看mac表ip 编辑:程序博客网 时间:2024/05/22 04:03
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) { if(nums.size() == 0) return false; int step = nums[0]; for(int i=1; i<nums.size(); i++) { step--; if(step < 0) return false; step = max(step, nums[i]); } return true; }};
0 0
- Leetcode 贪心 Jump Game
- [leetcode][贪心] Jump Game
- leetcode---Jump Game---贪心
- leetcode---jump-game---贪心
- Leetcode 贪心 Jump Game II
- [leetcode][贪心] Jump Game II
- leetCode #55 Jump Game 贪心
- LeetCode Jump Game(贪心算法)
- LeetCode Jump Game II(贪心)
- [leetcode]55. Jump Game 贪心
- leetcode 55. Jump Game [贪心]
- Jump Game (能否到达终点,贪心) 【leetcode】
- [LeetCode]Jump Game II(贪心&&DP!!!!!)
- LeetCode 之 Jump Game(贪心算法)
- leetCode #45 Jump Game II 贪心
- leetcode -- Jump Game II -- 贪心,要看
- LeetCode-55-Jump Game(贪心)-Medium
- leetcode 55. Jump Game-贪心算法
- 标量类型集锦
- Java基础练习之用数组写一个员工管理系统
- UVA—297四分树(非二叉树)
- php 写内容到文件,把日志写到log文件
- 【原创】10元买啤酒2个空瓶换一瓶4个瓶盖换一瓶经典算法
- leetcode---Jump Game---贪心
- 使用Python进行Android自动化测试
- 一站式linux0.11内核head.s代码段图表详解
- POJ 2420:A Star not a Tree?
- Spring02
- 设计模式—简单工厂模式
- Spring03
- protobuf 生成对应的文件
- MD5初探及简单应用