JAVA_LeetCode 3502_Minimum Cost to Reach Every Position

JAVA_LeetCode 3502_Minimum Cost to Reach Every Position 풀이 class Solution { public int[] minCosts(int[] cost) { // 작은 수를 뒤로 정렬 for(int i = 1; i < cost.length; i++){ cost[i] = Math.min(cost[i], cost[i - 1]); } return cost; } } * 출처 https://leetcode.com/problems/minimum-cost-to-reach-every-position...