217.leetcode Contains Duplicate(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.

检测数组中是否有重复的数，采用sort的方式然后判断是否由相邻重复的数，有则返回true.

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