切棍子的最小成本

/*
 * Problem: You are given a stick of length 'n' with certain marked positions given in the array 'cuts'. 
 * You need to cut the stick at these positions in such a way that the total cost of cutting is minimized.
 * The cost of a cut is the length of the stick being cut at that moment.
 * 
 * Approach with Java Streams: 
 * 1. Similar to the Java solution, but we use streams to handle sorting and conversion of the cuts array.
 * 2. We still use dynamic programming to find the minimum cost.
 */
import java.util.*; 
import java.util.stream.IntStream; 
public class MinCostCuttingStream { 
    public int minCost(int n, int[] cuts) { 
        int[] newCuts = IntStream.concat(IntStream.of(0), IntStream.concat(Arrays.stream(cuts), IntStream.of(n))).sorted().toArray(); 
        int m = newCuts.length; 
        int[][] dp = new int[m][m]; 
        for (int i = m - 2; i >= 0; i--) { 
            for (int j = i + 2; j < m; j++) { 
                dp[i][j] = IntStream.range(i + 1, j).map(k -> dp[i][k] + dp[k][j] + newCuts[j] - newCuts[i]).min().orElse(Integer.MAX_VALUE); 
            } 
        } 
        return dp[0][m - 1]; 
    } 
}