-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSolution.java
More file actions
50 lines (44 loc) · 1.24 KB
/
Solution.java
File metadata and controls
50 lines (44 loc) · 1.24 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
package Array.No_217_Contains_Duplicate;
import java.util.Arrays;
/**
* FileName: Solution
* Author: EdisonLi的家用MacBook Pro
* Date: 2019-02-10 18:45
* Description: Contains Duplicate
* <p>
* Given an array of integers, find if the array contains any duplicates.
* <p>
* Your function should return true if any value appears at least twice in the array, and it should return false if every element is distinct.
* <p>
* Example 1:
* <p>
* Input: [1,2,3,1]
* Output: true
* Example 2:
* <p>
* Input: [1,2,3,4]
* Output: false
* Example 3:
* <p>
* Input: [1,1,1,3,3,4,3,2,4,2]
* Output: true
*/
public class Solution {
public boolean containsDuplicate(int[] nums) {
if (nums.length == 1 || nums.length == 0) return false;
for (int i = 0; i < nums.length; i++) {
for (int j = i + 1; j < nums.length; j++) {
if (nums[i] == nums[j]) return true;
}
}
return false;
}
public boolean containsDuplicate1(int[] nums) {
if (nums.length == 1 || nums.length == 0) return false;
Arrays.sort(nums);
for (int i = 0; i < nums.length - 1; ++i) {
if (nums[i] == nums[i + 1]) return true;
}
return false;
}
}