哪种连续子字符串更长

/*
 * Solution Approach using Java Streams:
 * 1. Convert the string s into a stream of characters.
 * 2. Use a map to store the lengths of all contiguous 1's and 0's segments.
 * 3. Group the characters and find the maximum length for both 1's and 0's.
 * 4. Compare the maximum length of 1's and 0's, and return true if the maximum length of 1's is greater, else false.
 */
import java.util.*;
import java.util.stream.*;

public class Solution {
    public boolean checkZeroOnes(String s) {
        Map<Character, Integer> maxCount = new HashMap<>();
        maxCount.put('1', 0);
        maxCount.put('0', 0);

        IntStream.range(0, s.length())
            .boxed()
            .collect(Collectors.groupingBy(i -> s.charAt(i), Collectors.toList()))
            .forEach((k, v) -> {
                int maxLength = 1;
                int currentLength = 1;
                for (int j = 1; j < v.size(); j++) {
                    if (v.get(j) == v.get(j - 1) + 1) {
                        currentLength++;
                    } else {
                        maxLength = Math.max(maxLength, currentLength);
                        currentLength = 1;
                    }
                }
                maxLength = Math.max(maxLength, currentLength);
                maxCount.put(k, Math.max(maxCount.get(k), maxLength));
            });
        return maxCount.get('1') > maxCount.get('0');
    }
}