Tap here to switch tabs
Problem
Submissions

Problem: Final Array State After K Multiplication Operations I

Final Array State After K Multiplication Operations I gives an array, multiplier, and operation count. Return its final state after multiplying the first minimum each time.

Statement

Given an integer array nums, an integer k, and an integer multiplier:

  • Perform k operations on nums.

  • In each operation:

    • Find the minimum element x in nums (if there are multiple occurrences of the minimum value, choose the first occurrence).

    • Replace x with x * multiplier.

Return the final state of nums after all k operations.

Constraints:

  • 1<=1 <= nums.length <=100<= 100

  • 1<=1 <= nums[i] <=100<= 100

  • 1<=1 <= k <=10<= 10

  • 1<=1 <= multiplier <=5<= 5

⋮
Tap here to switch tabs
Problem
Submissions

Problem: Final Array State After K Multiplication Operations I

Final Array State After K Multiplication Operations I gives an array, multiplier, and operation count. Return its final state after multiplying the first minimum each time.

Statement

Given an integer array nums, an integer k, and an integer multiplier:

  • Perform k operations on nums.

  • In each operation:

    • Find the minimum element x in nums (if there are multiple occurrences of the minimum value, choose the first occurrence).

    • Replace x with x * multiplier.

Return the final state of nums after all k operations.

Constraints:

  • 1<=1 <= nums.length <=100<= 100

  • 1<=1 <= nums[i] <=100<= 100

  • 1<=1 <= k <=10<= 10

  • 1<=1 <= multiplier <=5<= 5