#3743

Maximize Cyclic Partition Score

grandmaster · 2320 · lc hard +32 · 12.5% accepted · 48 likes · top 0%

Description

Given a cyclic array nums and integer k, partition nums into at most k contiguous subarrays (allowing wrap-around) and return the maximum sum of subarray ranges (maximum minus minimum of each part).

Code

1

2

3

class Solution:
    def maximumScore(self, nums: List[int], k: int) -> int:

class Solution:
    def maximumScore(self, nums: List[int], k: int) -> int: