将数组分成最小总代价的子数组 I

/*
 * Problem: You are given an integer array nums of length n.
 * The cost of an array is its first element. For example, the cost of [1,2,3] is 1.
 * You need to divide nums into 3 contiguous and non-overlapping subarrays.
 * Return the minimum sum of the costs of these subarrays.
 *
 * Example 1:
 * Input: nums = [1,2,3,12]
 * Output: 6
 * Explanation: The best way to split into 3 subarrays is: [1], [2], and [3,12].
 * The total cost is 1 + 2 + 3 = 6.
 * Other ways are:
 * - [1], [2,3], and [12] with a total cost of 1 + 2 + 12 = 15.
 * - [1,2], [3], and [12] with a total cost of 1 + 3 + 12 = 16.
 *
 * Example 2:
 * Input: nums = [5,4,3]
 * Output: 12
 * Explanation: The best way to split into 3 subarrays is: [5], [4], and [3].
 * The total cost is 5 + 4 + 3 = 12.
 *
 * Example 3:
 * Input: nums = [10,3,1,1]
 * Output: 12
 * Explanation: The best way to split into 3 subarrays is: [10,3], [1], and [1].
 * The total cost is 10 + 1 + 1 = 12.
 */

import java.util.Arrays;

public class Solution {
    public int minCost(int[] nums) {
        int n = nums.length;
        return Arrays.stream(nums).sorted().limit(3).sum();
    }
}