-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathprogram13.java
More file actions
64 lines (42 loc) · 1.28 KB
/
program13.java
File metadata and controls
64 lines (42 loc) · 1.28 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
53
54
55
56
57
58
59
60
61
62
63
64
/*
41. First Missing Positive
Hard
Given an unsorted integer array nums, return the smallest missing positive integer.
You must implement an algorithm that runs in O(n) time and uses constant extra space.
Example 1:
Input: nums = [1,2,0]
Output: 3
Explanation: The numbers in the range [1,2] are all in the array.
Example 2:
Input: nums = [3,4,-1,1]
Output: 2
Explanation: 1 is in the array but 2 is missing.
Example 3:
Input: nums = [7,8,9,11,12]
Output: 1
Explanation: The smallest positive integer 1 is missing.
*/
package LeetCode;
import java.util.Arrays;
public class program13 {
static int firstMissingPositive(int[] nums) {
int num = 1;
Arrays.sort(nums);
for (int i = 0; i < nums.length; i++) {
if (nums[i] <= 0 || nums[i] == (num - 1)) {
continue;
}
else {
if (nums[i] != num) {
return num;
}
num++;
}
}
return num;
}
public static void main(String[] args) {
int nums[] = { 0, 1, 1, 2, 2 };
System.out.println(firstMissingPositive(nums));
}
}