1005. Maximize Sum Of Array After K Negations.py

class Solution(object):
    def largestSumAfterKNegations(self, A, K):
        """
        :type A: List[int]
        :type K: int
        :rtype: int
        """
        a = sorted(A)
        x = 0
        n = len(A)
        while x < n and K > 0:
            if a[x] < 0:
                a[x] *= -1
                x += 1
                K -= 1
            elif a[x] == 0:
                break
            else:
                if K % 2 == 0:
                    break
                else:
                    a[x] -= 2 * min(a)
                    break
        return sum(a)