g2701_2800.s2735_collecting_chocolates.Solution Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java Show documentation

Java-based LeetCode algorithm problem solutions, regularly updated

The newest version!

package g2701_2800.s2735_collecting_chocolates;

// #Medium #Array #Enumeration #2023_09_22_Time_24_ms_(96.97%)_Space_43.5_MB_(92.12%)

public class Solution {
    public long minCost(int[] nums, int x) {
        int n = nums.length;
        int[] dp = new int[n];
        long res = 0;
        for (int i = 0; i < n; i++) {
            dp[i] = nums[i];
            res += nums[i];
        }
        for (int i = 1; i < n; i++) {
            long sum = (long) i * x;
            for (int j = 0; j < n; j++) {
                int currIndex = (j + i >= n) ? j + i - n : j + i;
                dp[j] = Math.min(dp[j], nums[currIndex]);
                sum += dp[j];
            }
            res = Math.min(res, sum);
        }
        return res;
    }
}