题目
算法思想
- 数组
代码
class Solution {
public:
int duplicateInArray(vector<int>& nums) {
int len = nums.size() - 1;
int a[1100],res = -1;
for (int i = 1; i <= 1002; i++) a[i] = 0;
for (vector<int>::iterator it = nums.begin(); it != nums.end(); it++)
{
int value = *it;
if (value < 0 || value > len) return -1;
a[value] ++;
if (a[value] > 1) res = value;
}
if (res != -1) return res;
else return -1;
}
};