leetcode-217. Contains Duplicate

最新推荐文章于 2024-11-01 11:29:32 发布

原创最新推荐文章于 2024-11-01 11:29:32 发布 · 239 阅读

0 ·

CC 4.0 BY-SA版权

leetcode 专栏收录该内容

24 篇文章

订阅专栏

本文介绍了解决LeetCode 217题“Contains Duplicate”的两种方法：一种是通过双重循环查找重复元素；另一种是先排序再检查相邻元素是否相同的方法。这两种方法都可用于判断数组中是否存在重复的整数。

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.

Subscribe to see which companies asked this question.

/*
class Solution {
public:
    bool containsDuplicate(vector<int>& nums) {
        vector<int> res;
        for(int i = 0; i < nums.size(); ++i){
            for(int j =i+1; j< nums.size(); ++j){
                if(nums[i] == nums[j])
                    res.push_back(nums[i]);
            }
        }
        return !res.empty();
    }
};
*/

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