首页 > 其他 > 详细

[LeetCode] Contains Duplicate

时间:2015-09-20 19:05:42      阅读:224      评论:0      收藏:0      [点我收藏+]

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.

 

分析:哈希表用法。时间复杂度O(n),空间复杂度O(n)

class Solution {
public:
    bool containsDuplicate(vector<int>& nums) {
        if (nums.empty()) return false;
        
        unordered_map<int, int> count;
        
        for (auto i : nums) {
            ++count[i];
        } 
        
        for (auto i : count) {
            if (i.second > 1)
                return true;
        }
        
        return false;
    }
};

 

[LeetCode] Contains Duplicate

原文:http://www.cnblogs.com/vincently/p/4823851.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!