Maximize Sum Of Array After K Negations

        heapq.heapify(A)
        for i in range(K):
            heapq.heapreplace(A, -A[0])
            
        return sum(A)

最近在看python，该题现在最快的算法

A.sort()
        bZero = False
        ret = 0;
        minNum = sys.maxsize
        for a in A:
            if a < 0:
                if K > 0:
                    a = -a
                    K -= 1
                ret += a
            elif a == 0:
                bZero = True
            else:
                ret+=a
                
            minNum = min(minNum, a)
        
        if bZero:
            return ret
        else:
            if K%2 == 1:
                ret -= minNum*2
                
        return ret

自己写的，记录一下