您的位置:首页 > 编程语言

leetcode:217 Contains Duplicate-每日编程第九题

2015-12-10 14:37 387 查看

Contains Duplicate

Total Accepted: 54264 Total Submissions: 139273 Difficulty: Easy

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.

思路:

1).排序。

2).遍历数组,看是否有相邻的数相等

class Solution {
public:
    bool containsDuplicate(vector<int>& nums) {
        int len=nums.size();
        if(len<2){
            return false;
        }
        sort(nums.begin(),nums.end());
        for(int i=0;i<len-1;i++){
            if(nums[i]==nums[i+1]){
                return true;
            }
        }
        return false;
    }
};
内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息
标签: