使用Java8确定包含范围内不包含坏数的最长整数段

import java.util.*;
import java.util.stream.*;

public class LongestSegment {
    public static void main(String[] args) {
        Set<Integer> badNumbers = new HashSet<>(Arrays.asList(3, 5, 7));
        int start = 1;
        int end = 10;

        int longestSegment = findLongestSegment(start, end, badNumbers);
        System.out.println("Longest segment length: " + longestSegment);
    }

    public static int findLongestSegment(int start, int end, Set<Integer> badNumbers) {
        return IntStream.rangeClosed(start, end)
                .filter(n -> !badNumbers.contains(n))
                .boxed()
                .collect(Collectors.groupingByConcurrent(n -> n / 10)) // 假设段是以10为间隔分组
                .values()
                .stream()
                .mapToInt(List::size)
                .max()
                .orElse(0);
    }
}