摘要：
1 class Twitter 2 { 3 public: 4 unordered_map<int,priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>>> u;//用户 -> (出现的次数,推文) 小根堆 阅读全文
posted @ 2020-04-22 22:29
Jinxiaobo0509
阅读(130)
评论(0)
推荐(0)
摘要：
1 class Solution 2 { 3 public: 4 vector<int> intersect(vector<int>& nums1, vector<int>& nums2) 5 { 6 vector<int> res; 7 unordered_map<int,int> hash1,h 阅读全文
posted @ 2020-04-22 19:31
Jinxiaobo0509
阅读(96)
评论(0)
推荐(0)
摘要：
1 class Solution 2 { 3 public: 4 vector<int> intersection(vector<int>& nums1, vector<int>& nums2) 5 { 6 vector<int> res; 7 unordered_map<int,int> hash 阅读全文
posted @ 2020-04-22 19:25
Jinxiaobo0509
阅读(99)
评论(0)
推荐(0)
摘要：
1 class Solution 2 { 3 public: 4 vector<int> topKFrequent(vector<int>& nums, int k) 5 { 6 vector<int> res; 7 unordered_map<int,int> hash; 8 for(auto a 阅读全文
posted @ 2020-04-22 19:19
Jinxiaobo0509
阅读(98)
评论(0)
推荐(0)
摘要：
1 class Solution 2 { 3 unordered_set<char> hash = {'a','e','i','o','u','A','E','I','O','U'}; 4 public: 5 string reverseVowels(string s) 6 { 7 int n = 阅读全文
posted @ 2020-04-22 19:08
Jinxiaobo0509
阅读(122)
评论(0)
推荐(0)
摘要：
1 class Solution 2 { 3 public: 4 void reverseString(vector<char>& s) 5 { 6 int n = s.size(); 7 for(int i = 0;i < n/2;i ++) swap(s[i],s[n - i - 1]); 8 阅读全文
posted @ 2020-04-22 18:57
Jinxiaobo0509
阅读(92)
评论(0)
推荐(0)
摘要：
1 //以3来进行划分 2 class Solution 3 { 4 public: 5 int integerBreak(int n) 6 { 7 if(n <= 3) return n - 1; //必须切一刀 8 //n >= 5 2*(n-2) > n 3*(n-3) > n 且3*(n-3 阅读全文
posted @ 2020-04-22 18:53
Jinxiaobo0509
阅读(166)
评论(0)
推荐(0)
摘要：
1 class Solution 2 { 3 public: 4 vector<int> countBits(int num) 5 { 6 vector<int> res; 7 for(int i = 0;i <= num;i ++) 8 { 9 int count = 0; 10 for(int 阅读全文
posted @ 2020-04-22 18:12
Jinxiaobo0509
阅读(90)
评论(0)
推荐(0)
摘要：
1 /** 2 * Definition for a binary tree node. 3 * struct TreeNode { 4 * int val; 5 * TreeNode *left; 6 * TreeNode *right; 7 * TreeNode(int x) : val(x), 阅读全文
posted @ 2020-04-22 11:44
Jinxiaobo0509
阅读(101)
评论(0)
推荐(0)
摘要：
1 class Solution 2 { 3 public: 4 bool increasingTriplet(vector<int>& nums) 5 { 6 int len = nums.size(); 7 if (len < 3) return false; 8 int small = INT 阅读全文
posted @ 2020-04-22 11:26
Jinxiaobo0509
阅读(102)
评论(0)
推荐(0)
浙公网安备 33010602011771号