Question: (JAVA)Given an array nums containing n + 1 integers where each integer is between 1 and n (inclusive), it is easy to see that at
(JAVA)Given an array nums containing n + 1 integers where each integer is between 1 and n (inclusive), it is easy to see that at least one duplicate number must exist. Assume that there is only one duplicate number, find the duplicate one.
You must not modify the array (assume the array is read only).
You must use only constant, O(1) extra space.
Your running time should be better than quadratic.
There is only one duplicate number in the array, but it could be repeated more than once
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
