我最近在某处遇到一个问题:
Suppose you have an array of 1001 integers. The integers are in random order, but you know each of the integers is between 1 and 1000 (inclusive). In addition, each number appears only once in the array, except for one number, which occurs twice. Assume that you can access each element of the array only once. Describe an algorithm to find the repeated number. If you used auxiliary storage in your algorithm, can you find an algorithm that does not require it?
我想知道的是第二部分，即不使用辅助存储。你有什么想法吗？
最佳答案
只需将它们全部相加，然后减去如果仅使用 1001 个数字所期望的总数。
例如:
Input: 1,2,3,2,4 => 12
Expected: 1,2,3,4 => 10
Input - Expected => 2
关于arrays - 如何在随机排列的连续整数数组中找到重复元素？，我们在Stack Overflow上找到一个类似的问题： https://stackoverflow.com/questions/2605766/