Contains Duplicate LeetCode solution in C++

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