forked from ngiengkianyew/daily-coding-problem
-
Notifications
You must be signed in to change notification settings - Fork 1
/
problem_152.py
40 lines (29 loc) · 921 Bytes
/
problem_152.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
from random import random
import bisect
class ProbablisticGenerator:
def __init__(self, numbers, probabilities):
assert sum(probabilities) == 1
self.numbers = numbers
self.cum_probs = list()
current_cum_prob = 0
for prob in probabilities:
current_cum_prob += prob
self.cum_probs.append(current_cum_prob)
def generate_number(self):
rand = random()
index = bisect.bisect_left(self.cum_probs, rand)
return self.numbers[index]
# Tests
numbers = [1, 2, 3, 4]
probs = [0.1, 0.5, 0.2, 0.2]
pg = ProbablisticGenerator(numbers, probs)
num_exp = 10000
outcomes = dict()
for num in numbers:
outcomes[num] = 0
for _ in range(num_exp):
gen_num = pg.generate_number()
outcomes[gen_num] += 1
for num, prob in zip(numbers, probs):
outcomes[num] = round(outcomes[num] / num_exp, 1)
assert outcomes[num] == prob