Find All Lonely Numbers in the Array LeetCode solution in Python

1
# Runtime: 4306 ms (Top 5.12%) | Memory: 38.2 MB (Top 71.56%)
2
class Solution:
3
    def findLonely(self, nums: List[int]) -> List[int]:
4
        m = Counter(nums)
5
        return [n for n in nums if m[n] == 1 and m[n - 1] + m[n + 1] == 0]