easy java solution
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\n    public int largestSumAfterKNegations(int[] nums, int k) {\n        for (int i = 0; i < k; i++) {\n            Arrays.sort(nums);\n            nums[0] = -nums[0];\n        }\n        int answer = 0;\n        for (int num : nums) {\n            answer += num;\n        }\n        return answer;\n    }\n}\n```
['Java']