Maximum Score Of Spliced Array LeetCode solution in Python

1
class Solution:
2
    def maximumsSplicedArray(self, nums1: List[int], nums2: List[int]) -> int:
3
        n = len(nums1)
4
        nums3 = [0] * n
5
        nums4 = [0] * n
6
        for i in range(n):
7
            nums3[i] = nums1[i] - nums2[i]
8
            nums4[i] = nums2[i] - nums1[i]
9

10
        maxsubseq1 = maxsubseq2 = 0
11
        v1 = v2 = 0
12

13
        # use kadane algorithm to solve this max subseq problem
14
        for i in range(n):
15
            maxsubseq1 = max(maxsubseq1 + nums3[i], nums3[i])
16
            maxsubseq2 = max(maxsubseq2 + nums4[i], nums4[i])
17
            v1 = max(v1, maxsubseq1)
18
            v2 = max(v2, maxsubseq2)
19

20
        _sum1 = sum(nums1)
21
        _sum2 = sum(nums2)
22
        return max(_sum1 + v2, _sum2 + v1)