Algorithm문제풀이: LeetCode의 “217. Contains Duplicate”
🧑🚀문제링크: https://leetcode.com/problems/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
여러분은 어떻게 접근하시고 또 해결 하셨는지 댓글로 알려주세요~~
