528. Random Pick with Weight

528. Random Pick with Weight


Given an array w of positive integers, where w[i] describes the weight of index i, write a function pickIndex which randomly picks an index in proportion to its weight.

Note:

  1. 1 <= w.length <= 10000
  2. 1 <= w[i] <= 10^5
  3. pickIndex will be called at most 10000 times.
    Example 1:
Input: 
["Solution","pickIndex"]
[[[1]],[]]
Output: [null,0]

Example 2:

Input: 
["Solution","pickIndex","pickIndex","pickIndex","pickIndex","pickIndex"]
[[[1,3]],[],[],[],[],[]]
Output: [null,0,1,1,1,0]
Explanation of Input Syntax:

The input is two lists: the subroutines called and their arguments. Solution’s constructor has one argument, the array w. pickIndex has no arguments. Arguments are always wrapped with a list, even if there aren’t any.

方法1:

思路:

class Solution {
private:
    vector<int> prefix;
public:
    Solution(vector<int>& w) {
        prefix = w;
        for (int i = 1; i < w.size(); i++){
            prefix[i] = prefix[i - 1] + w[i];
        }
    }

    int pickIndex() {
        int range = prefix.back();
        int sample = rand() % range;
        
        // for (int i = 0; i < prefix.size(); i++) {
        //     if (prefix[i] > sample) return i;
        // }
        // return -1;
        
        int left = 0, right = prefix.size();
        while (left < right) {
            int mid = left + (right - left) / 2;
            if (prefix[mid] > sample) {
                right = mid;
            }
            else {
                left = mid + 1;
            }
        }
        return right;
    }
};
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值