Leetcode
2020.05.05 09:34

# 448. Find All Numbers Disappeared in an Array

조회 수 680 추천 수 0 댓글 0
?

#### 단축키

Prev이전 문서

Next다음 문서

크게 작게 위로 아래로 댓글로 가기 인쇄
?

#### 단축키

Prev이전 문서

Next다음 문서

크게 작게 위로 아래로 댓글로 가기 인쇄

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<>();

}

if(hset.contains(num) == false){
}
}

return list;
}
}

?

 제목+내용제목내용댓글이름닉네임아이디태그
List of Articles
번호 분류 제목 글쓴이 날짜 조회 수
17 Leetcode 270. Closest Binary Search Tree Value 2020.05.01 655
16 Leetcode 997. Find the Town Judge 2020.05.02 716
15 Leetcode 203. Remove Linked List Elements 2020.05.04 648
14 Leetcode 876. Middle of the Linked List 2020.05.04 676
13 Leetcode 872. Leaf-Similar Trees 2020.05.04 678
12 Leetcode 897. Increasing Order Search Tree 2020.05.04 687
11 Leetcode 532. K-diff Pairs in an Array 2020.05.04 727
10 Leetcode 628. Maximum Product of Three Numbers 2020.05.05 668
» Leetcode 448. Find All Numbers Disappeared in an Array 2020.05.05 680
8 Leetcode 724. Find Pivot Index 2020.05.05 714
7 Leetcode 605. Can Place Flowers 2020.05.05 694
6 Leetcode 697. Degree of an Array 2020.05.05 782
5 Leetcode 222. Count Complete Tree Nodes 2020.05.05 707
4 Leetcode 844. Backspace String Compare 2020.05.05 736
3 Leetcode 56. Merge Intervals 2020.05.05 691
2 Leetcode 225. Implement Stack using Queues 2020.05.05 739
1 Leetcode 720. Longest Word in Dictionary 2020.05.07 840
Board Pagination Prev 1 2 3 4 Next
/ 4