#3695

Maximize Alternating Sum Using Swaps

expert · 1110 · lc hard +32 · 64.2% accepted · 56 likes · top 67%

Description

An integer array nums and swap pairs swaps[i] = [p, q] are given. Elements at swappable index pairs may be exchanged any number of times in any order. The alternating sum is nums[0] - nums[1] + nums[2] - ... (add even-indexed, subtract odd-indexed). Return the maximum alternating sum achievable.

Code

1

2

3

class Solution:
    def maxAlternatingSum(self, nums: List[int], swaps: List[List[int]]) -> int:

class Solution:
    def maxAlternatingSum(self, nums: List[int], swaps: List[List[int]]) -> int: