摘要:
class FirstUnique { public: FirstUnique(vector<int>& nums) { for(auto num:nums){ q.push(num); mp[num]++; } } int showFirstUnique() { while(!q.empty()& 阅读全文
摘要:
class Solution { public: int leastBricks(vector<vector<int>>& wall) { unordered_map<int,int> mp;//统计缝的重复数量 for(int i=0;i<wall.size();++i){ int len=0; 阅读全文