class Solution {
public:
vector<int> findErrorNums(vector<int>& nums) {
vector<int> V(nums.size() + 1, 0);
for(auto num : nums) V[num]++;
vector<int> ans(2, 0);
for(int ii = 1; ii < V.size(); ii++) {
if(V[ii] == 2) ans[0] = ii;
if(V[ii] == 0) ans[1] = ii;
}
return ans;
}
};
【leetcode 位运算(不是) C++】645. Set Mismatch
猜你喜欢
转载自blog.csdn.net/m0_37454852/article/details/113932275
今日推荐
周排行