Given an array of integers nums containing 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 using only constant extra space.
1 <= n <= 10^5nums.length == n + 11 <= nums[i] <= nnums appear only once except for precisely one integer which appears two or more timesnums = [1,3,4,2,2]2nums = [3,1,3,4,2]3nums = [3,3,3,3,3]3