【Google面经】L3 - New Grad | Waterloo | Phone Screen Google 电面 开发岗

兔精精 2020-5-21 1109


Problem

There is a grasshopper that starts from the root node, if the hopper hops to a node with no children the hopper is stuck and can't move further. If the grasshopper has the option to move then it has to make the hop. Basically the goal is to find the probability of the grasshopper landing at each node.

Example p : probability parent -> [children]

(p : 0) -> [(p: 0) -> [(p:1/3)] , (p: 0) -> [(p:1/6), (p:1/6)] , (p: 1/3)]

最后于 2020-6-1 被maomoke编辑 ,原因:
最新回复 (0)
返回