Final Array State After K Multiplication Operations II
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
xinnums. If there are multiple occurrences of the minimum value, select the one that appears first. - Replace the selected minimum value
xwithx * multiplier.
After the k operations, apply modulo 10^9 + 7 to every value in nums.
Return an integer array denoting the final state of nums after performing all k operations and then applying the modulo.
Example 1
Input
nums = [2,1,3,5,6], k = 5, multiplier = 2Output
[8,4,6,5,6]After five operations the array becomes [8, 4, 6, 5, 6], and applying modulo does not change any value.
Example 2
Input
nums = [100000,2000], k = 2, multiplier = 1000000Output
[999999307,999999993]After two operations the array becomes [100000000000, 2000000000], which becomes [999999307, 999999993] after applying modulo 10^9 + 7.
Constraints
- 1 <= nums.length <= 10^4
- 1 <= nums[i] <= 10^9
- 1 <= k <= 10^9
- 1 <= multiplier <= 10^6