- 题目:https://leetcode.com/problems/contains-duplicate/
- 思路:排序之后,看有没有连续两个相同的
- 坑:有连续两个相同的返回true,否则返回false
- 代码
class Solution { public: bool containsDuplicate(vector<int>& nums) { if (nums.size() <= 1) return false; sort(nums.begin(), nums.end()); for (int i = 1; i < nums.size(); i++) { if (nums[i] == nums[i-1]) return true; } return false; } };