CPP Easiest Solution
\n\n\tvector<int> findLonely(vector<int>& nums) {\n\t\tmap<int, int> m;\n        vector<int> res;\n        for (int n : nums) ++m[n];\n        for (const auto [
\n```\n\tvector<int> findLonely(vector<int>& nums) {\n\t\tmap<int, int> m;\n        vector<int> res;\n        for (int n : nums) ++m[n];\n        for (const auto [n, cnt] : m)\n            if (cnt == 1 && m.count(n + 1) == 0 && m.count(n - 1) == 0) res.push_back(n);\n        return res;\n    }\n```
[]