250x250
반응형
Notice
Recent Posts
Recent Comments
Link
N
(Leet Code c++)Contains Duplicate 본문
728x90
반응형
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
class Solution {
public:
bool containsDuplicate(vector<int>& nums) {
map<int, int> m;
for(int i = 0; i < nums.size(); i++){
m[nums[i]]++;
if(m[nums[i]] >= 2){
return true;
}
}
return false;
}
};
728x90
반응형
'Leet Code 알고리즘' 카테고리의 다른 글
(Leet Code c++)Implement Stack using Queues (0) | 2021.07.26 |
---|---|
(Leet Code c++)Contains Duplicate(2) (0) | 2021.07.23 |
(Leet Code c++)Reverse Linked List (0) | 2021.07.23 |
(Leet Code c++)Isomorphic Strings (0) | 2021.07.23 |
(Leet Code c++)Count Primes (0) | 2021.07.22 |