摘要:
1 class Solution 2 { 3 public: 4 bool containsNearbyDuplicate(vector<int>& nums, int k) 5 { 6 unordered_map<int,int> hash; 7 for(int i = 0;i < nums.si 阅读全文
posted @ 2020-04-10 16:26
Jinxiaobo0509
阅读(118)
评论(0)
推荐(0)
摘要:
1 class Solution 2 { 3 public: 4 bool containsDuplicate(vector<int>& nums) 5 { 6 unordered_map<int,int> hash; 7 for(auto a : nums) 8 { 9 if(++ hash[a] 阅读全文
posted @ 2020-04-10 16:17
Jinxiaobo0509
阅读(64)
评论(0)
推荐(0)
摘要:
1 // [1,3],[4,7],[9,9] 2 // L[1] = 3,L[4] = 7,L[9] = 9; 3 // R[3] = 1,R[7] = 4,R[9] = 9; 4 class SummaryRanges 5 { 6 map<int,int> L,R; 7 unordered_set 阅读全文
posted @ 2020-04-10 15:15
Jinxiaobo0509
阅读(170)
评论(0)
推荐(0)
摘要:
1 class MedianFinder 2 { 3 priority_queue<int,vector<int>,greater<int>> up;//小根堆 4 priority_queue<int> down;//大根堆 5 public: 6 MedianFinder() {} 7 8 vo 阅读全文
posted @ 2020-04-10 11:08
Jinxiaobo0509
阅读(109)
评论(0)
推荐(0)

浙公网安备 33010602011771号