乘坐火车路线的最少费用

/*
 * LeetCode 2361: Minimum Costs Using the Train Line
 * 
 * Problem statement: You are given a list of train stations and the cost to travel between each pair of adjacent stations. Find the minimum cost to travel from the first station to the last station.
 * 
 * Approach using Java Streams:
 * 1. Use dynamic programming but with a more functional approach using Java Streams.
 * 2. Initialize a list of costs with the first station having a cost of 0 and others as Integer.MAX_VALUE.
 * 3. Use stream operations to iterate over the stations and calculate the minimum cost.
 */
import java.util.*;
import java.util.stream.*;

public class MinimumTrainCostStream {
    public int minCost(int[] costs) {
        int n = costs.length;
        int[] dp = new int[n + 1];
        Arrays.fill(dp, Integer.MAX_VALUE);
        dp[0] = 0;
        IntStream.range(0, n)
            .forEach(i -> dp[i + 1] = Math.min(dp[i + 1], dp[i] + costs[i]));
        return dp[n];
    }
}