paper help!# Biology - 生物学
l*x
1 楼
上周五面的
上来问简历，很奇怪对我做的一个东西很赶兴趣，还问了一个常见的scheme
感觉是内行。。。
接着3道题
1. A game between player A and B with a dice. Each time A toss it, B has two
options: stop or continue. If B asks to stop, he will get the reward equal
to number on the face of the dice. If B asks to continue, then A toss again
and B makes new decision. The question is what is the best strategy for B so
that B can make the highest reward.
2. Sorted arrays M and N with len m and n, find intersection of them.
Then ask if m >> n, how to do i
上来问简历，很奇怪对我做的一个东西很赶兴趣，还问了一个常见的scheme
感觉是内行。。。
接着3道题
1. A game between player A and B with a dice. Each time A toss it, B has two
options: stop or continue. If B asks to stop, he will get the reward equal
to number on the face of the dice. If B asks to continue, then A toss again
and B makes new decision. The question is what is the best strategy for B so
that B can make the highest reward.
2. Sorted arrays M and N with len m and n, find intersection of them.
Then ask if m >> n, how to do i
