Maximize Sum Of Array After K Negations LeetCode solution in Python

1
from heapq import heapify, heapreplace
2

3

4
class Solution:
5
    def largestSumAfterKNegations(self, nums: List[int], k: int) -> int:
6
        heapify(nums)
7
        while k and nums[0] < 0:
8
            heapreplace(nums, -nums[0])
9
            k -= 1
10
        if k % 2:
11
            heapreplace(nums, -nums[0])
12
        return sum(nums)