trival
class Solution {public: vector<int> findDuplicates(vector<int>& nums) { vector<int> counts(nums.size()+1,0);//start from 1 vector<int> result; for(int i=0;i<nums.size();i++) if(counts[nums[i]]==1) result.push_back(nums[i]); else counts[nums[i]]=1; return result; }};新闻热点
疑难解答
