Please solve the programming task below using a self-contained code snippet in a markdown code block.

You are given an integer array nums. A number x is lonely when it appears only once, and no adjacent numbers (i.e. x + 1 and x - 1) appear in the array.
Return all lonely numbers in nums. You may return the answer in any order.
 
Please complete the following python code precisely:
```python
class Solution:
    def findLonely(self, nums: List[int]) -> List[int]:
```