转换字符串的最少操作次数

/*
 * Problem: Given a string 's' composed of 'X' and 'O', determine the minimum number of operations to convert all characters to 'O'.
 * An operation consists of selecting three consecutive characters and converting them to 'O'.
 * 
 * Solution using Java Streams: 
 * 1. Use IntStream to iterate over the string indices and filter only those indices where the character is 'X'.
 * 2. Use a reduction operation to calculate the number of operations by skipping two characters after an operation.
 */

import java.util.stream.IntStream;

public class StreamSolution {
    public int minimumMoves(String s) {
        int[] count = {0};
        IntStream.range(0, s.length())
                 .filter(i -> s.charAt(i) == 'X')
                 .forEach(i -> {
                     count[0]++;
                     for (int j = 0; j < 3 && i + j < s.length(); j++) {
                         s = s.substring(0, i + j) + 'O' + s.substring(i + j + 1);
                     }
                 });
        return count[0];
    }
}