Maximum Twin Sum of a Linked List LeetCode solution in Python

1
# Runtime: 2246 ms (Top 8.54%) | Memory: 54.1 MB (Top 58.68%)
2
class Solution:
3
    def pairSum(self, head: Optional[ListNode]) -> int:
4
        nums = []
5
        curr = head
6
        while curr:
7
            nums.append(curr.val)
8
            curr = curr.next
9

10
        N = len(nums)
11
        res = 0
12
        for i in range(N // 2):
13
            res = max(res, nums[i] + nums[N - i - 1])
14
        return res