由单个字符重复的最长子字符串

/*
 * Solution for the given problem using Java Streams
 *
 * We process each query one by one and use streams to update the character and find the longest repeating substring.
 */

import java.util.Arrays;
import java.util.stream.IntStream;

public class SolutionStream {
    public int[] longestRepeating(String s, String queryCharacters, int[] queryIndices) {
        StringBuilder sb = new StringBuilder(s);
        return IntStream.range(0, queryCharacters.length())
            .map(i -> {
                sb.setCharAt(queryIndices[i], queryCharacters.charAt(i));
                return findLongestRepeatingSubstring(sb.toString());
            })
            .toArray();
    }

    private int findLongestRepeatingSubstring(String s) {
        int[] maxLength = {1};
        int[] currentLength = {1};
        IntStream.range(1, s.length()).forEach(i -> {
            if (s.charAt(i) == s.charAt(i - 1)) {
                currentLength[0]++;
                maxLength[0] = Math.max(maxLength[0], currentLength[0]);
            } else {
                currentLength[0] = 1;
            }
        });
        return maxLength[0];
    }
}