LeetCode:217. Contains Duplicate

来源:互联网 发布:常见的网络协议有哪些 编辑:程序博客网 时间:2024/06/06 02:22

     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.

AC:

class Solution {public:    bool containsDuplicate(vector<int>& nums) {        int length = nums.size();        if(length==1||length==0)        return false;        set<int> temp;        temp.insert(nums[0]);        for(int i=1;i<length;i++)            {                if(temp.count(nums[i])==1)                    return true;                else                        temp.insert(nums[i]);            }        return false;    }};

0 0
原创粉丝点击