Simplest c++
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)$$ -->\n\n- Space complexity:\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> res ; \n        unordered_map<int,int> m ;\n        for(auto x:nums)\n        m[x]++ ; \n        for(auto x:m)\n        {\n            if(x.second==1 && m.find(x.first+1)==m.end() && m.find(x.first-1)==m.end())\n            res.push_back(x.first);\n        }\n        return res;\n        \n    }\n};\n```
['C++']