K-Concatenation Maximum Sum LeetCode solution in Python

1
class Solution:
2
    def kConcatenationMaxSum(self, nums: List[int], k: int) -> int:
3
        def maxSum(k):
4
            res = cur = 0
5
            for _ in range(k):
6
                for num in nums:
7
                    cur = max(cur + num, num)
8
                    res = max(res, cur)
9

10
            return res
11

12
        return (max(0, k - 2) * max(0, sum(nums)) + maxSum(min(2, k))) % (10**9 + 7)