| English | 简体中文 |
Given an array of integers
n + 1 integers where each integer is in the range
[1, n] inclusive.
There is only one repeated number in
nums, return this repeated number.
Input: nums = [1,3,4,2,2] Output: 2
Input: nums = [3,1,3,4,2] Output: 3
Input: nums = [1,1] Output: 1
Input: nums = [1,1,2] Output: 1
2 <= n <= 3 * 104
nums.length == n + 1
1 <= nums[i] <= n
- All the integers in
numsappear only once except for precisely one integer which appears two or more times.
- How can we prove that at least one duplicate number must exist in
- Can you solve the problem without modifying the array
- Can you solve the problem using only constant,
- Can you solve the problem with runtime complexity less than