freeCodeCamp/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-323-bitwise-or-oper...

32 lines
687 B
Markdown
Raw Blame History

This file contains ambiguous Unicode characters!

This file contains ambiguous Unicode characters that may be confused with others in your current locale. If your use case is intentional and legitimate, you can safely ignore this warning. Use the Escape button to highlight these characters.

---
id: 5900f4b01000cf542c50ffc2
title: 问题323对随机整数进行按位或运算
challengeType: 5
videoUrl: ''
---
# --description--
令y0y1y2...是随机无符号32位整数的序列
即0≤yi <232每个值的可能性均等
对于序列xi给出以下递归x0 = 0且
xi = xi-1 | yi-1对于i>0。|是按位或运算符)
可以看出对于所有i≥N最终将存在一个索引N使得xi = 232 -1所有比特的位模式
找到N的期望值。 将答案四舍五入到小数点后10位。
# --hints--
`euler323()`应该返回6.3551758451。
```js
assert.strictEqual(euler323(), 6.3551758451);
```
# --solutions--