#Leetcode# 217. Contains Duplicate

https://leetcode.com/problems/contains-duplicate/

 

Given an array of integers, find if the array contains any duplicates.

Your function should return true if any value appears at least twice in the array, and it should return false if every element is distinct.

Example 1:

Input: [1,2,3,1]
Output: true

Example 2:

Input: [1,2,3,4]
Output: false

Example 3:

Input: [1,1,1,3,3,4,3,2,4,2]
Output: true

代码：

class Solution {
public:
    bool containsDuplicate(vector<int>& nums) {
        map<int, int> mp;
        mp.clear();
        for(int i = 0; i < nums.size(); i ++) {
            mp[nums[i]] ++;
        }
        
        int cnt = 0;
        for(int i = 0; i < nums.size(); i ++) {
            if(mp[nums[i]] > 1) return true;
            else if(mp[nums[i]] == 1) cnt ++;
        }
        if(cnt == nums.size()) return false;       
    }
};