Solution URL
https://leetcode.com/submissions/detail/423751819/
代码
class Solution {
public int findDuplicate(int[] nums) {
//time: O(N)
//space: O(N)
Set<Integer> set = new HashSet<>();
int res = 0;
for(int i = 0; i < nums.length; i++){
if(set.contains(nums[i])){
res = nums[i];
break;
}
set.add(nums[i]);
}
return res;
}
}
