文件: root - text - article - 2020 - 01 - smallest-number-that-is-not-a-sum-of-a-subset-of-list.txt
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 455 次阅读, 53105 次搜索 | 66 个单词
| 浏览 | 博客存档
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 455 次阅读, 53105 次搜索 | 66 个单词
| 浏览 | 博客存档
Hi, here's your problem today. This problem was recently asked by AirBNB:
Given a sorted list of positive numbers, find the smallest positive number that cannot be a sum of any subset in the list.
Example:
Input: [1, 2, 3, 8, 9, 10]
Output: 7
Numbers 1 to 6 can all be summed by a subset of the list of numbers, but 7 cannot.
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 455 次阅读, 53105 次搜索 | 66 个单词 Given a sorted list of positive numbers, find the smallest positive number that cannot be a sum of any subset in the list.
Example:
Input: [1, 2, 3, 8, 9, 10]
Output: 7
Numbers 1 to 6 can all be summed by a subset of the list of numbers, but 7 cannot.
def findSmallest(nums):
# Fill this in.
print findSmallest([1, 2, 3, 8, 9, 10])
# 7
猜您喜欢...
- Windows Scripting
- Daily Interview Problem: Group Words that are Anagrams
- Algorithm Interview: Subarray With Target Sum
- Daily Interview Problem: Reverse Words in a String
- Find Missing Numbers in an Array
- Delphi Dynamic Array
- Algorithm Interview: No Adjacent Repeating Characters
- Daily Interview Puzzle: Minimum Size Subarray Sum
- Skip the readings, focus on problems. And use all the hints!
- 56 Bytes
©2006~2024 牛排过熟 - 0.01617 秒 - 1230.698 KB/s - 38 在线 内存: 493.77 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="索引, 跟踪">
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - 服务器 PHP 版本号: 7.4.33
评论 (0)
读写完全 - 一般 - 最小 - 表格 - 所有评论 - 统计
当前页暂时没有评论。