Final Array State After K Multiplication Operations I

You are given an integer array nums, an integer k, and an integer multiplier.

You need to perform k operations on nums. In each operation:

• Find the minimum value x in nums. If there are multiple occurrences of the minimum value, select the one that appears first.

• Replace the selected minimum value x with x * multiplier.

Return an integer array denoting the final state of nums after performing all k operations.

LeetCode Problem - 3264

class Solution {
    public int[] getFinalState(int[] nums, int k, int multiplier) {
        // Perform the operation k times
        for (int i = 0; i < k; i++) {
            // Find the minimum number and its index in the array
            int[] tempArr = minNum(nums);
            // Multiply the minimum number by the multiplier and update the array
            nums[tempArr[1]] = tempArr[0] * multiplier;
        }
        // Return the final state of the array
        return nums;
    }

    // Helper method to find the minimum number in the array and its index
    public int[] minNum(int[] arr) {
        int min = Integer.MAX_VALUE; // Initialize the minimum value to the largest possible integer
        int idx = -1; // Initialize the index to -1 (invalid index)

        // Iterate through the array to find the minimum value and its index
        for (int i = 0; i < arr.length; i++) {
            if (arr[i] < min) {
                min = arr[i];
                idx = i;
            }
        }

        // Store the minimum value and its index in the result array
        int[] ans = new int[2];
        ans[0] = min;
        ans[1] = idx;

        // Return the result array containing the minimum value and its index
        return ans;
    }
}