Contains Duplicate Problem


Description

LeetCode Problem 217.

Given an integer array nums, return true if any value appears at least twice in the array, and return false if every element is distinct.

Example 1:

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

Example 2:

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

Example 3:

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

Constraints:

  • 1 <= nums.length <= 10^5
  • -10^9 <= nums[i] <= 10^9


Sample C++ Code

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
class Solution {
public:
    bool containsDuplicate(vector<int>& nums) {
        bool distinct = true;
        map<int, int> ht;
        for (int i = 0; i < nums.size(); i ++) {
            int n = nums[i];
            if (ht.find(n) == ht.end())
                ht[n] = 0;
            ht[n] ++;
            if (ht[n] > 1) {
                distinct = false;
            }
        }
        return !distinct;          
    }
};




Related Posts

X Of A Kind In A Deck Of Cards Problem

LeetCode 914. In a deck of cards, each card has...

Word Subsets Problem

LeetCode 916. You are given two string arrays words1 and...

Vowel Spellchecker Problem

LeetCode 966. Given a wordlist, we want to implement a...

Verifying An Alien Dictionary Problem

LeetCode 953. In an alien language, surprisingly, they also use...

Unique Morse Code Words Problem

LeetCode 804. International Morse Code defines a standard encoding where...

Unique Email Addresses Problem

LeetCode 929. Every valid email consists of a local name...