-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathprogram8.java
More file actions
71 lines (49 loc) · 1.41 KB
/
program8.java
File metadata and controls
71 lines (49 loc) · 1.41 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
65
66
67
68
69
70
71
/*
287. Find the Duplicate Number
Medium
19K
2.8K
Companies
Given an array of integers nums containing n + 1 integers where each integer is in the range [1, n] inclusive.
There is only one repeated number in nums, return this repeated number.
You must solve the problem without modifying the array nums and uses only constant extra space.
Example 1:
Input: nums = [1,3,4,2,2]
Output: 2
Example 2:
Input: nums = [3,1,3,4,2]
Output: 3
*/
package LeetCode;
public class program8 {
static int findDuplicate(int[] nums) {
// int duplicate=0;
// boolean flag= false;
// for(int i=0;i<nums.length;i++){
// for(int j=i+1;j<nums.length;j++){
// if(nums[i]==nums[j]){
// flag =true;
// duplicate=nums[i];
// break;
// }
// }
// if(flag){
// break;
// }
// }
// return duplicate;
int freq[] = new int[nums.length + 1];
for (int i = 0; i < nums.length; i++) {
if (freq[nums[i]] == 0) {
freq[nums[i]] += 1;
} else {
return nums[i];
}
}
return 0;
}
public static void main(String[] args) {
int nums[] = { 1, 3, 4, 2, 2 };
System.out.println(findDuplicate(nums));
}
}