cpp || map ||easy solution
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:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\no(n)\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\no(n)\n\n# Code\n```\nclass Solution {\npublic:\n    vector<int> findLonely(vector<int>& nums) {\n        vector<int>v;\n        unordered_map<int,int>m;\n        for(int i=0;i<nums.size();i++)\n        {\n            m[nums[i]]++;\n        }\n        for(int i=0;i<nums.size();i++)\n        {\n            if(m[nums[i]]==1 && m.find(nums[i]-1)==m.end() && m.find(nums[i]+1)==m.end())\n            {\n                v.push_back(nums[i]);\n            }\n        }\n        return v;\n    }\n};\n```
['Hash Table', 'C++']