LeetCode: Contains Duplicate

来源:互联网 发布:linux timer settime 编辑:程序博客网 时间:2024/06/10 15:30

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> m_map;        for(int i = 0; i < nums.size(); i++)        {            if(m_map[nums[i]] != 0)                return true;            else                m_map[nums[i]] = 1;        }        return false;    }};


Round 3:

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


0 0