o(n) python solution
\ndef findLonely(self, nums: List[int]) -> List[int]:\n        dic = {}\n        res = []\n        for i in nums:\n            if i not in dic:\n               
```\ndef findLonely(self, nums: List[int]) -> List[int]:\n        dic = {}\n        res = []\n        for i in nums:\n            if i not in dic:\n                dic[i]=1\n            else:\n                dic[i]+=1\n        for i in dic:\n            if dic[i] != 1:\n                continue\n            elif i+1 in dic:\n                continue\n            elif i-1 in dic:\n                continue\n            else:\n                res.append(i)\n        return res\n```
['Python']