我的题解:
class Solution {
public:
Solution()
{
}
int findRepeatNumber(vector<int>& nums) {
int vector_num=nums.size();
int flag=0;//判断是否是第一个数
vector<int> counts(vector_num);
for(int i=0;i<vector_num;i++)
counts[nums[i]]++;//统计容器中每个元素出现的次数
int vector_num2=counts.size();
for(int i=0;i<vector_num2;i++)//对结果进行输出
if(counts[i]>1)
return i;
return 0;
}
};
精选题解01:
class Solution {
public:
int findRepeatNumber(vector<int>& nums) {
unordered_map<int, bool> map;
for(int num : nums) {
if(map[num]) return num;
map[num] = true;
}
return -1;
}
};
精选题解02:
class Solution {
public:
int findRepeatNumber(vector<int>& nums) {
int i = 0;
while(i < nums.size()) {
if(nums[i] == i) {
i++;
continue;
}
if(nums[nums[i]] == nums[i])
return nums[i];
swap(nums[i],nums[nums[i]]);
}
return -1;
}
};
注:
链接:https://leetcode-cn.com/problems/shu-zu-zhong-zhong-fu-de-shu-zi-lcof/solution/mian-shi-ti-03-shu-zu-zhong-zhong-fu-de-shu-zi-yua/
来源:力扣(LeetCode)
著作权归作者所有。商业转载请联系作者获得授权,非商业转载请注明出处。