【LeetCode】45. Jump Game II
2024-08-22 12:22:33
Jump Game II
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.)
ret:目前为止的jump数
curRch:从A[0]进行ret次jump之后达到的最大范围
curMax:从0~i这i+1个A元素中能达到的最大范围
当curRch < i,说明ret次jump已经不足以覆盖当前第i个元素,因此需要增加一次jump,使之达到
记录的curMax。
class Solution {
public:
int jump(int A[], int n) {
int ret = ;
int curMax = ;
int curRch = ;
for(int i = ; i < n; i ++)
{
if(curRch < i)
{
ret ++;
curRch = curMax;
}
curMax = max(curMax, A[i]+i);
}
return ret;
}
};
最新文章
- C#对于文件的读写
- stopPropagation, preventDefault 和 return false 的区别
- //解决validator验证插件多个name相同只验证第一的问题
- selenium获取多窗口句柄并一一切换至原窗口句柄(三个窗口)
- Spark 累加器
- Spring Collections XML 配置
- IE/Firefox/Chrome等浏览器保存Cookie的位置
- 在CentOS里使用MySQL Connector/C++
- Show a heart shaped
- hive 调用java的函数和科学记数法转换
- jsp bean标签
- getBoundingClientRect()兼容性处理
- 封装JDBC:实现简单ORM框架lfdb
- testlink 下载地址
- const的一些总结
- Date Time Picker控件
- CSS样式表基础知识、样式表的分类及选择器
- c: c代码书写规范
- boost asio allocation
- 《深入.NET平台和C#编程》内部测试题-笔试试卷答案