N

(Leet Code c++)Contains Duplicate 본문

Leet Code 알고리즘

(Leet Code c++)Contains Duplicate

naeunchan 2021. 7. 23. 11:59
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
반응형