文件: root - text - article - 2019 - 11 - first-missing-positive-integer.txt
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 483 次阅读, 22483 次搜索 | 89 个单词
| 浏览 | 博客存档
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 483 次阅读, 22483 次搜索 | 89 个单词
| 浏览 | 博客存档
Hi, here's your problem today. This problem was recently asked by Facebook:
You are given an array of integers. Return the smallest positive integer that is not present in the array. The array may contain duplicate entries.
For example, the input [3, 4, -1, 1] should return 2 because it is the smallest positive integer that doesn't exist in the array.
Your solution should run in linear time and use constant space.
Here's your starting point:
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 483 次阅读, 22483 次搜索 | 89 个单词 You are given an array of integers. Return the smallest positive integer that is not present in the array. The array may contain duplicate entries.
For example, the input [3, 4, -1, 1] should return 2 because it is the smallest positive integer that doesn't exist in the array.
Your solution should run in linear time and use constant space.
Here's your starting point:
def first_missing_positive(nums):
# Fill this in.
print first_missing_positive([3, 4, -1, 1])
# 2
猜您喜欢...
- Fix Brackets
- Design Tic-Tac-Toe
- Algorithm Interview: Convert Roman Numerals to Decimal
- Daily Interview Problem: Group Words that are Anagrams
- Consecutive Ones
- Daily Interview Problem: Reverse Integer
- Daily Interview Problem: Distribute Bonuses
- Autorun.inf Virus Protection
- Algorithm Interview: Subarray With Target Sum
- [Daily Problem] Remove k-th Last Element From Linked List
©2006~2024 牛排过熟 - 0.00747 秒 - 2769.825 KB/s - 43 在线 内存: 493.8 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)
读写完全 - 一般 - 最小 - 表格 - 所有评论 - 统计
当前页暂时没有评论。