|
| 1 | +packageeasy; |
| 2 | + |
| 3 | +importjava.util.HashSet; |
| 4 | +importjava.util.Set; |
| 5 | + |
| 6 | +/** |
| 7 | + * 217. Contains Duplicate QuestionEditorial Solution My Submissions Total Accepted: 106831 Total |
| 8 | + * Submissions: 252115 Difficulty: Easy Given an array of integers, find if the array contains any |
| 9 | + * duplicates. Your function should return true if any value appears at least twice in the array, |
| 10 | + * and it should return false if every element is distinct. |
| 11 | + */ |
| 12 | +publicclassContainsDuplicate { |
| 13 | +publicbooleancontainsDuplicate(int[]nums) { |
| 14 | +if(nums ==null ||nums.length ==0)returnfalse; |
| 15 | +Set<Integer>set =newHashSet(); |
| 16 | +for(inti :nums){ |
| 17 | +if(!set.add(i))returntrue; |
| 18 | + } |
| 19 | +returnfalse; |
| 20 | + } |
| 21 | + |
| 22 | +publicstaticvoidmain(String...strings){ |
| 23 | +int[]nums =newint[]{1,2,3,4,3}; |
| 24 | +ContainsDuplicatetest =newContainsDuplicate(); |
| 25 | +System.out.println(test.containsDuplicate(nums)); |
| 26 | + } |
| 27 | +} |