-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathFindDisappearedNumbers.java
More file actions
52 lines (39 loc) · 1.07 KB
/
FindDisappearedNumbers.java
File metadata and controls
52 lines (39 loc) · 1.07 KB
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
package com.vinay.practice.lc;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
// https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array/description/
public class FindDisappearedNumbers {
public static void main(String[] args) {
// TODO Auto-generated method stub
//int[] nums = {4,3,2,7,8,6,5,1};
int[] nums = {3,1,3,4,2};
//int[] nums = {1,1};
System.out.println(findMissingNumbers(nums).toString());
}
public static List<Integer> findMissingNumbers(int[] nums) {
int i=0;
List<Integer> missingNumber = new ArrayList<Integer>();
// sort
while(i < nums.length) {
int correct = nums[i] - 1;
if(nums[i] != nums[correct]) {
swap(nums, i, correct);
} else {
i++;
}
}
System.out.println(Arrays.toString(nums));
//find numbers
for(i=0; i<nums.length; i++) {
if(nums[i] != (i+1))
missingNumber.add((i+1));
}
return missingNumber;
}
public static void swap(int[] nums, int i, int correct) {
int temp = nums[correct];
nums[correct] = nums[i];
nums[i] = temp;
}
}