2130. Maximum Twin Sum of a Linked List
Medium
In a linked list of size n
, where n
is even, the ith
node (0-indexed) of the linked list is known as the twin of the (n-1-i)th
node, if 0 <= i <= (n / 2) - 1
.
For example, if
n = 4
, then node0
is the twin of node3
, and node1
is the twin of node2
. These are the only nodes with twins forn = 4
.
The twin sum is defined as the sum of a node and its twin.
Given the head
of a linked list with even length, return the maximum twin sum of the linked list.
Example 1:
Example 2:
Example 3:
Constraints:
The number of nodes in the list is an even integer in the range
[2, 105]
.1 <= Node.val <= 105
解題
把數值都存進陣列後暴力解。
Last updated