leetcode

0 class Solution {

1 public:

2 vector<int> findLonely(vector<int> &nums) {

3 sort(begin(nums), end(nums));

4

5 vector<int> res;

6 const int n = nums.size() - 1;

7 for (int i = 0; i <= n; i++) {

8 if (i < n && nums[i] == nums[i + 1]) continue;

9 if (i > 0 && nums[i] == nums[i - 1]) continue;

10 if (i > 0 && nums[i] - 1 == nums[i - 1]) continue;

11 if (i < n && nums[i] + 1 == nums[i + 1]) continue;

12 res.push_back(nums[i]);

13 }

14 return res;

15 }

16 };