c++ using hash
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:O(n)\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:O(n)\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n    vector<int> findLonely(vector<int>& nums) {\n        vector<int>v;\n       unordered_map<int,int>mp;\n       for(auto it:nums){\n           mp[it]++;\n       }\n       for(int i=0;i<nums.size();i++){\n           if(mp.find(nums[i]+1)==mp.end() && mp.find(nums[i]-1)==mp.end() && mp[nums[i]]<2){\n            v.push_back(nums[i]);\n           }\n       }\n       return v; \n    }\n};\n```
['Hash Table', 'C++']