[LeetCode] 217. Contains Duplicate

只要陣列有2個數字一樣就回傳true
217. Contains Duplicate

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

 

Constraints:

  • 1 <= nums.length <= 105
  • -109 <= nums[i] <= 109

HashSet比List還快, 所以用HasSet

public bool ContainsDuplicate(int[] nums)
{
    HashSet<int> hs = new HashSet<int>();
    foreach (int i in nums)
    {
        if (hs.Contains(i)) return true;
        hs.Add(i);
    }
    return false;
}

Taiwan is a country. 臺灣是我的國家