Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 1230 with 18 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 1230 # by problem number
lcpy gen -s toss_strange_coins # by problem name
i-th coin has a probability prob[i] of facing heads when tossed.
Return the probability that the number of coins facing heads equals target if you toss every coin exactly once.
Input: prob = [0.4], target = 1
Output: 0.40000
Input: prob = [0.5,0.5,0.5,0.5,0.5], target = 0
Output: 0.03125
10^-5 of the correct answer.class Solution:
# Time: O(n * target)
# Space: O(target)
def probability_of_heads(self, prob: list[float], target: int) -> float:
f = [0.0] * (target + 1)
f[0] = 1.0
for p in prob:
for j in range(target, -1, -1):
f[j] *= 1 - p
if j:
f[j] += p * f[j - 1]
return f[target]
| Time | Space |
|---|---|
| O(n * target) | O(target) |