Leetcode 217. Contains Duplicate

triplebee

发布于 2018-01-12 14:45:12

4520

发布于 2018-01-12 14:45:12

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.

判断数组中是否有重复元素，各种做法，解法太多了。

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

本文参与腾讯云自媒体分享计划，分享自作者个人站点/博客。

原始发表：2017-03-23 ，如有侵权请联系 cloudcommunity@tencent.com 删除

contains