448. Find All Numbers Disappeared in an Array
Given an array of integers where 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and others appear once.
Find all the elements of [1, n] inclusive that do not appear in this array.
Could you do it without extra space and in O(n) runtime? You may assume the returned list does not count as extra space.
Example:
Input: [4,3,2,7,8,2,3,1] Output: [5,6]
class Solution {
public List<Integer> findDisappearedNumbers(int[] nums) {
Set<Integer> hset = new HashSet<>();
List<Integer> list = new ArrayList<>();
int[] mask = new int[nums.length];
for(int i=0; i<mask.length; i++){
hset.add(nums[i]);
mask[i] = i + 1;
}
for(Integer num : mask){
if(hset.contains(num) == false){
list.add(num);
}
}
return list;
}
}[문제] https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array/
-
720. Longest Word in Dictionary
-
225. Implement Stack using Queues
-
56. Merge Intervals
-
844. Backspace String Compare
-
222. Count Complete Tree Nodes
-
697. Degree of an Array
-
605. Can Place Flowers
-
724. Find Pivot Index
-
448. Find All Numbers Disappeared in an Array
-
628. Maximum Product of Three Numbers
-
532. K-diff Pairs in an Array
-
897. Increasing Order Search Tree
-
872. Leaf-Similar Trees
-
876. Middle of the Linked List
-
203. Remove Linked List Elements
-
997. Find the Town Judge
-
270. Closest Binary Search Tree Value
-
687. Longest Univalue Path
-
783. Minimum Distance Between BST Nodes
-
235. Lowest Common Ancestor of a Binary Search Tree
