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.

题意

给你一个数组，判断是否有元素包含副本，全部元素都没有副本，输出false,反之输出true

题解

C++语言选用的是map, 构造元素和个数直接的映射。
Python选用的字典，和map思想类似。
所有时间复杂度为0(n)

python代码

class Solution(object):
    def containsDuplicate(self, nums):
        """
        :type nums: List[int]
        :rtype: bool
        """
        d = {}
        for i in range(0, len(nums)):#初始化
            d[nums[i]] = 0
        for i in range(0, len(nums)):
            d[nums[i]] = d[nums[i]] + 1
            if d[nums[i]] > 1:
                return True
        return False

C++代码

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