第一题红包A 100% function leastCost(nums, arr) { let dp = new Array(nums).fill(0); dp[0] = arr[0] / 2; dp[1] = Math.min(dp[0] + arr[1] - 5, arr[0] - 5 + arr[1] / 2); for (let i = 2; i < nums; i++) { dp[i] = Math.min( dp[i - 2] + arr[i - 1] - 5 + arr[i] / 2, dp[i - 1] + arr[i] - 5 ); } console.log(dp[n...