LeetCode217. Contains Duplicate [C++]

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.

Example 1:

Input: [1,2,3,1]
Output: true

Example 2:

Input: [1,2,3,4]
Output: false

Example 3:

Input: [1,1,1,3,3,4,3,2,4,2]
Output: true

解题思路:

直接map!!!

class Solution {
public:
    bool containsDuplicate(vector& nums) {
        map m;
        for(int i=0;i

LeetCode219. Contains Duplicate II [C++]

https://blog.csdn.net/ueh286/article/details/91975183

你可能感兴趣的:(LeetCode)