-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathProblem no 268.java
More file actions
37 lines (32 loc) · 965 Bytes
/
Copy pathProblem no 268.java
File metadata and controls
37 lines (32 loc) · 965 Bytes
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
// Ques : Find the missing number
// Ques link : https://leetcode.com/problems/missing-number/
package com.nitin;
public class MissingNumber {
public static void main(String[] args) {
int[] arr = {3, 0, 2, 1};
System.out.println(missingNumber(arr));
}
public static int missingNumber(int[] arr){
int i = 0;
while (i < arr.length) {
int correct = arr[i];
if (arr[i] < arr.length && arr[i] != arr[correct]) {
swap(arr, i, correct);
} else {
i++;
}
}
// search for missing number
for (int index = 0; index < arr.length; index++) {
if (arr[index] != index) {
return index;
}
}
return arr.length;
}
static void swap(int[] arr, int first, int second) {
int temp = arr[first];
arr[first] = arr[second];
arr[second] = temp;
}
}