Leetcode # 3264. Final Array State After K Multiplication Operations I

Problem

https://leetcode.com/problems/final-array-state-after-k-multiplication-operations-i

Solution

Time Complexity: O(len(nums)) + k * log(len(num)))
Space Complexity: O(len(nums))
(The input and output generally do not count towards the space complexity.)

class Solution:
  def getFinalState( \
      self, nums: List[int], k: int, multiplier: int) -> List[int]:
    pq = [[num, i] for i, num in enumerate(nums)]
    heapify(pq)
    for _ in range(k):
      heappushpop(pq, [pq[0][0] * multiplier, pq[0][1]])
    for num, i in pq:
      nums[i] = num
    return nums

 

Last Updated on 2024/12/16 by A1go

目錄
Bitnami