File: root - text - article - 2020 - 02 - find-missing-numbers-in-an-array.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 377 Views, 22204 Search Bots | 84 Words
| Browse | Archive
![Subscribe to Feed Burner Subscribe to Feed Burner](/images/form/rss.gif)
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 377 Views, 22204 Search Bots | 84 Words
![Subscribe to Feed Burner Subscribe to Feed Burner](/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.
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Cateogry: Computing | 377 Views, 22204 Search Bots | 84 Words 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.
![Subscribe to Feed Burner Subscribe to Feed Burner](/images/form/rss.gif)
Related Articles
- Daily Interview Problem: Minimum Removals for Valid Parenthesis
- Making a Height Balanced Binary Search Tree
- Algorithm Interview: String Compression
- Algorithm Interview: Maximum Path Sum in Binary Tree
- Generate All IP Addresses
- Daily Interview Puzzle: Falling Dominoes
- [Daily Problem] Validate Balanced Parentheses
- Daily Interview Problem: Deepest Node in a Binary Tree
- Spectrum Master
- 56 Bytes
©2006~2024 SteakOverCooked - 0.00775 Seconds(s) - 2605.846 KB/s - 12 Online
Memory: 492.85 KB
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - Server PHP Version: 7.4.33
How to Cook a Perfect Steak? | <meta name="robots" content="noindex, follow" />
![](/images/top.jpg)
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - Server PHP Version: 7.4.33
Read & Write - Normal - Mini - Post - All Comments - Statistics
Be the first one to comment this page !