//暴力破解
class Solution {
public:
int duplicateInArray(vector[HTML_REMOVED]& nums) {
int n = nums.size();
for (int nn=0;nn[HTML_REMOVED]n+1) return -1;
}
for(int i=0;i<n;i)
{
for(int j=i+1;j<n;j)
{
if(nums[i]==nums[j]) return nums[i];
}
}
return -1;
}
};