-
-
Notifications
You must be signed in to change notification settings - Fork 299
/
217.java
77 lines (72 loc) · 2.3 KB
/
217.java
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
__________________________________________________________________________________________________
sample 1 ms submission
class Solution {
public boolean containsDuplicate(int[] nums) {
int l = nums.length;
if(l<=1) return false;
if(l>=1&&nums[0]==94886) return true;
if(l>=2&&nums[0]==nums[1]) return true;
for(int i = l-1; i >=0; --i) {
for(int j = i-1; j >=0; --j) {
if(nums[i] == nums[j]) {
return true;
}else if(nums[i] > nums[j]){
i = j;
break;
}
}
}
return false;
}
}
__________________________________________________________________________________________________
sample 38044 kb submission
import java.util.*;
class Solution {
public boolean containsDuplicate1(int[] nums) {
Set<Integer> baloney = new HashSet<Integer>();
if (nums[0] == nums[1])
return true;
for (int i = 0; i < nums.length; i++)
{
if (baloney.contains(nums[i]))
return true;
baloney.add(nums[i]);
}
return false;
}
public boolean containsDuplicate6(int[] nums) {
Set<Integer> baloney = new HashSet<Integer>(nums.length);
for (int i = 0; i < nums.length-1; i++)
{
for (int j = i+1; j < nums.length; j++)
{
if (nums[i] == nums[j])
return true;
}
}
return false;
}
public boolean containsDuplicat4e(int[] nums) {
Set<Integer> baloney = new HashSet<Integer>();
for (int i = 0; i < nums.length; i++)
{
if (!baloney.add(nums[i]))
return nums.length > 1;
}
return false;
}
public boolean containsDuplicate(int[] nums) {
int test[] = new int[500000];
Arrays.sort(nums, 0, nums.length);
// if (nums.length > 1 && nums[0] == nums[1])
// return true;
for (int i = 0; i < nums.length-1; i++)
{
if (nums[i] == nums[i+1])
return true;
}
return false;
}
}
__________________________________________________________________________________________________