class Solution {
public:
int findRepeatNumber(vector<int>& nums) {
map<int,int>mp;
for(int i = 0; i < nums.size();i++) {
if(mp.count(nums[i])==1)return nums[i];
mp[nums[i]] = i;
}
return nums[0];
}
};
剑指offer03 数组中的重复数字
Guess you like
Origin blog.csdn.net/yonggandess/article/details/121387558
Ranking