Maximize Sum Of Array After K Negations LeetCode solution in Java

1
class Solution {
2
  public int largestSumAfterKNegations(int[] nums, int k) {
3

4
    PriorityQueue<Integer> minHeap = new PriorityQueue<>();
5
    for (int val : nums) minHeap.add(val);
6

7
    while (k > 0) {
8

9
      int curr = minHeap.poll();
10
      minHeap.add(-curr);
11
      k--;
12
    }
13

14
    int sum = 0;
15
    while (!minHeap.isEmpty()) {
16
      sum += minHeap.poll();
17
    }
18
    return sum;
19
  }
20
}