每日一题 2735. 收集巧克力（中等）

暴力枚举，真难甭

class Solution:
    def minCost(self, nums: List[int], x: int) -> int:
        n = len(nums)
        f = nums[:]
        ans = sum(f)

        for k in range(1, n):
            for i in range(n):
                f[i] = min(f[i], nums[(i + k) % n])
            ans = min(ans, k * x + sum(f))
        
        return ans