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 <= $10^5$$-10^9$ <= nums[i] <= $10^9$給定一個整數陣列 nums 要求寫一個演算法去判斷是否有重複值
可以透過 hashSet 來紀錄每次出現過的值 每次只要發現 hashSet 有出現過的值 就直接回傳 true
時間複雜度為 O(n) 空間複雜度為 O(n)
https://replit.com/@YuanyuLiang/golangcontainduplicate#sol/solution.go
https://replit.com/@YuanyuLiang/javacontainduplicate#src/main/java/Solution.java