文件: root - text - article - 2020 - 02 - find-missing-numbers-in-an-array.txt
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 377 次阅读, 22286 次搜索 | 84 个单词
| 浏览 | 博客存档
![定阅此目录的博客 定阅此目录的博客](/images/form/rss.gif)
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 377 次阅读, 22286 次搜索 | 84 个单词
![定阅此目录的博客 定阅此目录的博客](/images/form/rss.gif)
Hi, here's your problem today. This problem was recently asked by Twitter:
Given an array of integers of size n, where all elements are between 1 and n inclusive, find all of the elements of [1, n] that do not appear in the array. Some numbers may appear more than once.
Example:
Input: [4,5,2,6,8,2,1,5]
Output: [3,7]
For this problem, you can assume that you can mutate the input array.
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 377 次阅读, 22286 次搜索 | 84 个单词 Given an array of integers of size n, where all elements are between 1 and n inclusive, find all of the elements of [1, n] that do not appear in the array. Some numbers may appear more than once.
Example:
Input: [4,5,2,6,8,2,1,5]
Output: [3,7]
class Solution(object):
def findDisappearedNumbers(self, nums):
# Fill this in.
nums = [4, 6, 2, 6, 7, 2, 1]
print(Solution().findDisappearedNumbers(nums))
# [3, 5]
For this problem, you can assume that you can mutate the input array.
![定阅此目录的博客 定阅此目录的博客](/images/form/rss.gif)
猜您喜欢...
- [Daily Problem] Remove k-th Last Element From Linked List
- Patterns for breaking down questions you haven
- Daily Interview Problem: Queue Using Two Stacks
- Daily Interview Problem: Contiguous Subarray with Maximum Sum
- Daily Interview Problem: Merge K Sorted Linked Lists
- Algorithm Interview Question: H-Index
- Staying on a Chess Board
- Daily Interview Problem:Create a balanced binary search tree
- Daily Interview Problem: Largest BST in a Binary Tree
- Top K Frequent words
©2006~2024 牛排过熟 - 0.00733 秒 - 2616.863 KB/s - 9 在线
内存: 493.09 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
读写完全 - 一般 - 最小 - 表格 - 所有评论 - 统计
当前页暂时没有评论。