移除石子的最大得分

/*
 * Problem Description: 
 * You are playing a single-player game with three piles of stones, labeled a, b, and c.
 * In each turn, you can remove one stone from any two different non-empty piles and gain 1 point.
 * The game ends when two or more piles are empty. 
 * The task is to find the maximum score you can achieve.
 * 
 * Approach: 
 * - Use Java Streams to handle the sorting and operations on the piles.
 * - The optimal strategy remains the same as in the previous solution.
 */

import java.util.Arrays;

public class MaxScoreStream {
    public int maximumScore(int a, int b, int c) {
        int[] stones = {a, b, c};
        // Sort the array using Streams
        stones = Arrays.stream(stones).sorted().toArray();
        int maxScore = 0;
        while (stones[1] > 0) {
            // Reduce the two largest piles
            stones[2]--;
            stones[1]--;
            maxScore++;
            // Sort again using Streams
            stones = Arrays.stream(stones).sorted().toArray();
        }
        return maxScore;
    }
}