-
Notifications
You must be signed in to change notification settings - Fork 0
/
FindAllMissing.java
36 lines (31 loc) · 927 Bytes
/
FindAllMissing.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
package com.atharv;
import java.util.ArrayList;
import java.util.List;
// https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array/
// Asked in Google
class FindAllMissing {
public List<Integer> findDisappearedNumbers(int[] nums) {
int i = 0;
while (i < nums.length) {
int correct = nums[i] - 1;
if (nums[i] != nums[correct]) {
swap(nums, i , correct);
} else {
i++;
}
}
// just find missing numbers
List<Integer> ans = new ArrayList<>();
for (int index = 0; index < nums.length; index++) {
if (nums[index] != index+1) {
ans.add(index + 1);
}
}
return ans;
}
static void swap(int[] arr, int first, int second) {
int temp = arr[first];
arr[first] = arr[second];
arr[second] = temp;
}
}