[C++] Easy Solution | Counting | Hash Table
\nclass Solution {\npublic:\n    vector<int> findLonely(vector<int>& nums) {\n        unordered_map<int,int> m;\n        vector<int> ans;\n        for(int v : n
```\nclass Solution {\npublic:\n    vector<int> findLonely(vector<int>& nums) {\n        unordered_map<int,int> m;\n        vector<int> ans;\n        for(int v : nums) m[v]++;\n        for(int v : nums){\n            if(m[v] == 1 && m.count(v - 1) == 0 && m.count(v + 1) == 0){\n                ans.push_back(v);\n            }\n        }\n        return ans;\n    }\n};\n```
['C', 'C++']