LeetCode 217. 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.

class Solution {
public:
    bool containsDuplicate(vector<int>& nums) {
        set<int> m;
        for(int i = 0; i < nums.size(); i++) {
            m.insert(nums[i]);
        }
        return nums.size() != m.size();
    }
};

class Solution {

public:

bool containsDuplicate(vector<int>& nums) {

set<int> m;

for(int i = 0; i < nums.size(); i++) {

m.insert(nums[i]);

}

return nums.size() != m.size();

}

};

❤ 点击这里 -> 订阅《PAT | 蓝桥 | LeetCode学习路径 & 刷题经验》by 柳婼

❤ 点击这里 -> 订阅《从放弃C语言到使用C++刷算法的简明教程》by 柳婼

❤ 点击这里 -> 订阅PAT甲级乙级、蓝桥杯、GPLT天梯赛、LeetCode题解离线版