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