找出数组中的所有孤独数字

import java.util.Arrays;
import java.util.List;
import java.util.Map;
import java.util.stream.Collectors;

public class LonelyNumbersStream {
    /**
     * This method finds all lonely numbers in the given array using Java Streams.
     * A lonely number appears only once in the array and has no neighboring numbers.
     * @param nums the input array of integers
     * @return a list of lonely numbers
     */
    public List<Integer> findLonely(int[] nums) {
        Map<Integer, Long> countMap = Arrays.stream(nums)
                .boxed()
                .collect(Collectors.groupingBy(n -> n, Collectors.counting()));

        return Arrays.stream(nums)
                .filter(num -> countMap.get(num) == 1 && !countMap.containsKey(num - 1) && !countMap.containsKey(num + 1))
                .distinct()
                .collect(Collectors.toList());
    }

    public static void main(String[] args) {
        LonelyNumbersStream lns = new LonelyNumbersStream();
        int[] nums = {10, 6, 5, 8};
        System.out.println(lns.findLonely(nums));  // Output: [10, 8]
    }
}