package LeetCode;

import java.util.Arrays;

public class LC_1005 {
    public static void main(String[] args) {
        int k = 2;
        int[] nums = {2,-3,-1,5,-4};
        System.out.println(largestSumAfterKNegations(nums,k));
    }
    public static int largestSumAfterKNegations(int[] nums, int k) {
        int min = 0;
        if (k == 0) return Arrays.stream(nums).sum();
        for (int i = 0; i < k; i++) {
            int tmp = minIdx(nums);
            nums[tmp] = -nums[tmp];
        }
        return Arrays.stream(nums).sum();
    }


    public static int minIdx(int[] nums) {
        int minidx = 0;
        for (int i = 0; i < nums.length; i++)
            if (nums[minidx] > nums[i]) minidx = i;
        return minidx;
    }
}