1 题目描述
Given an array of integers, find if the array contains any duplicates. 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.
题目出处:https://leetcode.com/problems/contains-duplicate/
2 解题思路
使用HashSet中的contains方法提高效率。
3 源代码
package com.larry.easy;
import java.util.HashSet;
public class ContainsDuplicate {
public boolean containsDuplicate(int[] nums) {
HashSet<Integer> hs = new HashSet<Integer>();
for(int i = 0; i < nums.length; i++){
int cur = nums[i];
boolean cont = hs.contains(cur);
if(!cont) hs.add(cur);
else return true;
}
return false;
}
public static void main(String[] args) {
int[] nums = {1,2,2};
System.out.println(new ContainsDuplicate().containsDuplicate(nums));
}
}