"Leetcode" 217-contains Duplicate

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 ele ment is distinct.

Comparison of adjacent positions after solution 1:sort

1 classSolution {2  Public:3     BOOLContainsduplicate (vector<int>& nums) {//runtime:40ms4         if(Nums.size () <=1)return false;5 sort (Nums.begin (), Nums.end ());6          for(intI=1; I<nums.size (); i++){7             if(nums[i-1]==nums[i])return true;8         }9         return false;Ten     } One};

Solution 2:map record an existing int

1 classSolution {2  Public:3     BOOLContainsduplicate (vector<int>& nums) {//runtime:104ms4         if(Nums.size () <=1)return false;5map<int,BOOL>m;6          for(intI=0; I<nums.size (); i++){7             if(m[nums[i]]==true)return true;8m[nums[i]]=true;9         }Ten         return false; One     } A};

"Leetcode" 217-contains Duplicate