Python Logic
class Solution:\n    def largestSumAfterKNegations(self, nums: List[int], k: int) -> int:\n        \n        while k > 0:\n            nums.sort()\n            
class Solution:\n    def largestSumAfterKNegations(self, nums: List[int], k: int) -> int:\n        \n        while k > 0:\n            nums.sort()\n            nums[0] = nums[0] * -1\n            k = k -1\n        return sum(nums)\n            \n## \t\t\t``
[]