-
Notifications
You must be signed in to change notification settings - Fork 3
/
_0448_FindAllNumbersDisappearedInAnArray.java
57 lines (53 loc) · 1.99 KB
/
_0448_FindAllNumbersDisappearedInAnArray.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
package com.diguage.algorithm.leetcode;
import java.util.ArrayList;
import java.util.HashSet;
import java.util.List;
import java.util.Set;
/**
* = 448. Find All Numbers Disappeared in an Array
*
* https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array/[Find All Numbers Disappeared in an Array - LeetCode]
*
* @author D瓜哥, https://www.diguage.com/
* @since 2020-01-29 19:06
*/
public class _0448_FindAllNumbersDisappearedInAnArray {
/**
* Runtime: 5 ms, faster than 91.55% of Java online submissions for Find All Numbers Disappeared in an Array.
* Memory Usage: 48.5 MB, less than 33.96% of Java online submissions for Find All Numbers Disappeared in an Array.
*/
public List<Integer> findDisappearedNumbers(int[] nums) {
for (int i = 0; i < nums.length; i++) {
int newIndex = Math.abs(nums[i]) - 1;
if (nums[newIndex] > 0) {
nums[newIndex] *= -1;
}
}
List<Integer> result = new ArrayList<>();
for (int i = 1; i <= nums.length; i++) {
if (nums[i - 1] > 0) {
result.add(i);
}
}
return result;
}
/**
* Runtime: 21 ms, faster than 26.28% of Java online submissions for Find All Numbers Disappeared in an Array.
* Memory Usage: 53.1 MB, less than 15.09% of Java online submissions for Find All Numbers Disappeared in an Array.
*/
public List<Integer> findDisappearedNumbersMap(int[] nums) {
Set<Integer> result = new HashSet<>(nums.length);
for (int i = 1; i <= nums.length; i++) {
result.add(i);
}
for (int num : nums) {
result.remove(num);
}
return new ArrayList<>(result);
}
public static void main(String[] args) {
_0448_FindAllNumbersDisappearedInAnArray solution = new _0448_FindAllNumbersDisappearedInAnArray();
int[] n1 = {4, 3, 2, 7, 8, 2, 3, 1};
System.out.println(solution.findDisappearedNumbers(n1));
}
}