文件: root - text - article - 2019 - 12 - jump-to-the-end.txt
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 779 次阅读, 18857 次搜索 | 86 个单词
| 浏览 | 博客存档
![定阅此目录的博客 定阅此目录的博客](/images/form/rss.gif)
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 779 次阅读, 18857 次搜索 | 86 个单词
![定阅此目录的博客 定阅此目录的博客](/images/form/rss.gif)
Hi, here's your problem today. This problem was recently asked by Facebook:
Starting at index 0, for an element n at index i, you are allowed to jump at most n indexes ahead. Given a list of numbers, find the minimum number of jumps to reach the end of the list.
Example:
Input: [3, 2, 5, 1, 1, 9, 3, 4]
Output: 2
Explanation:
The minimum number of jumps to get to the end of the list is 2:
3 - 5 - 4
Here's a starting point:
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 779 次阅读, 18857 次搜索 | 86 个单词 Starting at index 0, for an element n at index i, you are allowed to jump at most n indexes ahead. Given a list of numbers, find the minimum number of jumps to reach the end of the list.
Example:
Input: [3, 2, 5, 1, 1, 9, 3, 4]
Output: 2
Explanation:
The minimum number of jumps to get to the end of the list is 2:
3 - 5 - 4
Here's a starting point:
def jumpToEnd(nums):
# Fill this in.
print jumpToEnd([3, 2, 5, 1, 1, 9, 3, 4])
# 2
![定阅此目录的博客 定阅此目录的博客](/images/form/rss.gif)
猜您喜欢...
- [Daily Problem] Longest Palindromic Substring
- Algorithm Interview: Subarray With Target Sum
- Non-decreasing Array with Single Modification
- Making a Height Balanced Binary Search Tree
- Daily Interview Problem: Deepest Node in a Binary Tree
- Algorithm Interview Question: H-Index
- Daily Interview Problem: Validate Binary Search Tree
- [Daily Problem] Remove k-th Last Element From Linked List
- Daily Interview Problem: Sort Colors
- Daily Interview Problem: Given two arrays, write a function to compute their intersection.
©2006~2024 牛排过熟 - 0.01255 秒 - 4412.195 KB/s - 12 在线
内存: 517.41 KB
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - 服务器 PHP 版本号: 7.4.33
牛排怎么做才好吃? | <meta name="机器人" content="不索引, 跟踪" />
![](/images/top.jpg)
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - 服务器 PHP 版本号: 7.4.33
读写完全 - 一般 - 最小 - 表格 - 所有评论 - 统计
当前页暂时没有评论。