【LeetCode-Algorithms】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.

题目大意

给定整数数组，查找数组是否包含任何重复项。如果数组中的任何值至少出现两次，则函数应返回true，如果每个元素都不同，则返回false

解题思路

查找一个数是否出现两次，则判断是否会落尽同一个坑中即可

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