码迷,mamicode.com
首页 > 其他好文 > 详细

LeetCode OJ:Contains Duplicate(是否包含重复)

时间:2015-10-17 13:27:08      阅读:154      评论:0      收藏:0      [点我收藏+]

标签:

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 class Solution {
 2 public:
 3     bool containsDuplicate(vector<int>& nums) {
 4         int sz = nums.size();
 5         if (sz <= 1) return true;
 6         sort(nums.begin(), nums.end());
 7         for (int i = 0; i < sz; ++i){
 8             if (nums[i] == nums[i - 1])
 9                 return false;
10         }
11         return true;
12     }
14 };

 

LeetCode OJ:Contains Duplicate(是否包含重复)

标签:

原文地址:http://www.cnblogs.com/-wang-cheng/p/4887334.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!