【第三轮】7.24-7.31 CareerCup 5.7

5.7 An array A contains all the integers from 0 through n, except for one number which is missing. In this problem, we cannot access an entire integer in A with a single operation. The elements of A are represented in binary, and the only operation we can use to access them is "fetch thejth bit ofAfi]," which takes constant time. Write code to find the missing integer. Can you do it in 0(n) time?

回复解法可以按照以下格式来

[indent][indent]【解题思路】

【时间复杂度】

【空间复杂度】

【gist link】

---------------OPTional，如果觉得test case比较好，欢迎写出来分享----------------------

【test case】[/indent]

[/indent]

Notice：

1、记得在程序注释中表明自己算法的时间、空间复杂度

2、代码难懂之处加注释

3、每道题目有对应的帖子，除了贴解法，欢迎讨论，集思广益

4、任何未尽之处，欢迎回报名帖提问，我会进一步作出修改