Java题解
class Solution {
public int duplicateInArray(int[] nums) {
if (nums.length <= 0) return -1;
//如果某些数字不在 0∼n−1 的范围内
for (int i = 0; i < nums.length; i++) {
if (nums[i] < 0 || nums[i] > nums.length - 1)
return -1;
}
for (int i = 0; i < nums.length; i++) {
while (nums[i] != i){
if (nums[i] == nums[nums[i]]) return nums[i];
int temp = nums[i];
nums[i] = nums[temp];
nums[temp] = temp;
}
}
return -1;
}
}