环形数组的子数组最大和

def solve(____):
    nums = list(map(int, nums.split(____)))
    n = len(____)
    def kadane(____):
        max_sum = arr[____]
        current = arr[____]
        for x in arr[____:]:
            current = max(____)
            max_sum = max(____)
        return max_sum
    normal = kadane(____)
    total = sum(____)
    inverted = [-x for x in nums]
    circular = total + kadane(____)
    print(max(____) if circular != ____ else normal)