g0201_0300.s0287_find_the_duplicate_number.Solution.cpp Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-all Show documentation

104 LeetCode algorithm problem solutions

There is a newer version: 1.8

// #Medium #Top_100_Liked_Questions #Array #Binary_Search #Two_Pointers #Bit_Manipulation
// #Binary_Search_II_Day_5 #Big_O_Time_O(n)_Space_O(n)
// #2024_05_24_Time_74_ms_(75.71%)_Space_66.1_MB_(19.28%)

#include 

class Solution {
public:
    int findDuplicate(std::vector& nums) {
        std::vector arr(nums.size() + 1, 0);
        for (int num : nums) {
            arr[num] += 1;
            if (arr[num] == 2) {
                return num;
            }
        }
        return 0;
    }
};