使括号有效的最少添加

// Java Stream solution
// Problem: Given a string s consisting of '(' and ')', return the minimum number of parentheses we must add to make the resulting string valid.
// Approach: Use IntStream to iterate through the string and calculate the necessary number of parentheses to add.
import java.util.stream.IntStream;

public class SolutionStream {
    public int minAddToMakeValid(String s) {
        int leftBrackets = 0; // Number of unmatched '(' brackets
        int rightBracketsToAdd = 0; // Number of ')' brackets to add

        rightBracketsToAdd = IntStream.range(0, s.length())
            .map(i -> s.charAt(i) == '(' ? 1 : -1)
            .reduce(0, (balance, x) -> {
                if (balance + x < 0) {
                    rightBracketsToAdd++;
                    return balance;
                }
                return balance + x;
            });

        return leftBrackets + rightBracketsToAdd;
    }
}