| 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.
You must solve the problem without modifying the array
nums and uses only constant extra space.
Input: nums = [1,3,4,2,2] Output: 2
Input: nums = [3,1,3,4,2] Output: 3
1 <= n <= 105
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 in linear runtime complexity?