-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathprogram12.java
More file actions
85 lines (54 loc) · 1.58 KB
/
program12.java
File metadata and controls
85 lines (54 loc) · 1.58 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
72
73
74
75
76
77
78
79
80
81
82
83
84
85
/*
217. Contains Duplicate
Easy
Given an integer array nums, return true if any value appears at least twice in the array, and return false if every element is distinct.
Example 1:
Input: nums = [1,2,3,1]
Output: true
Example 2:
Input: nums = [1,2,3,4]
Output: false
Example 3:
Input: nums = [1,1,1,3,3,4,3,2,4,2]
Output: true
*/
package LeetCode;
import java.util.Arrays;
public class program12 {
static boolean containsDuplicate(int[] nums) {
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]){
// int temp = nums[i];
// nums[i] = nums[j];
// nums[j] =temp;
// }
// }
// }
Arrays.sort(nums);
// for(int i=0;i<nums.length;i++){
// for(int j=i+1;j<nums.length;j++){
// if(nums[i]==nums[j]){
// flag = true;
// break;
// }
// }
// if(flag){
// break;
// }
// }
// return flag;
for(int i=0;i<nums.length-1;i++){
if(nums[i] == nums[i+1]){
flag = true;
return flag;
}
}
return flag;
}
public static void main(String[] args) {
int[] nums = {0};
System.out.println(containsDuplicate(nums));;
}
}