python3-算法刷题-数组-带权重的随机选择算法-更新中

参考：https://labuladong.github.io/algo/2/20/30/

---

【中等】528.按权重随机选择

https://leetcode.cn/problems/random-pick-with-weight/


思路：

import random
class Solution:

    def __init__(self, w: list[int]):
        n = len(w)
        # 构建前缀和数组
        self.preSum = [0]
        for i in range(1, n+1):
            self.preSum.append(self.preSum[i-1] + w[i-1])

    def binarySearchLeftBound(self, nums: list[int], target: int) -> int:
        left = 0
        right = len(nums) - 1
        while left <= right:
            mid = left + (right - left) // 2
            if nums[mid] == target:
                return mid
            elif nums[mid] < target:
                left = mid + 1
            else:
                right = mid - 1
        return left


    def pickIndex(self) -> int:
        n = len(self.preSum)
        # 在[1, preSump[n-1]]中随机选择一个数字
        target = random.randint(1, self.preSum[n-1])
        ans = self.binarySearchLeftBound(self.preSum, target)
        return ans - 1