美文网首页
217. Contains Duplicate

217. Contains Duplicate

作者: SilentDawn | 来源:发表于2018-08-14 21:46 被阅读0次

Problem

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

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

Code

static int var = [](){
    std::ios::sync_with_stdio(false);
    cin.tie(NULL);
    return 0;
}();
class Solution {
public:
    bool containsDuplicate(vector<int>& nums) {
        map<int,int> dict;
        for(int i=0;i<nums.size();i++){
            if(dict.find(nums[i])==dict.end())
                dict[nums[i]] = 1;
            else
                return true;
        }
        return false;
    }
};

Result

217. Contains Duplicate.png

相关文章

网友评论

      本文标题:217. Contains Duplicate

      本文链接:https://www.haomeiwen.com/subject/coebbftx.html