https://leetcode.com/problems/design-twitter/

class Twitter {
unordered_map<int, set<int> > follower_mp;
unordered_map<int, set<int> > followee_mp;
unordered_map<int, vector<pair<int, int> > > twitter_self_mp;
int timestamp;
public:
/** Initialize your data structure here. */
Twitter() {
timestamp = ;
} /** Compose a new tweet. */
void postTweet(int userId, int tweetId) { if (twitter_self_mp.find(userId) == twitter_self_mp.end()) {
vector<pair<int, int> > tmp_vec;
twitter_self_mp[userId] = tmp_vec;
}
timestamp++;
twitter_self_mp[userId].insert(twitter_self_mp[userId].begin(), make_pair(timestamp, tweetId)); } /** Retrieve the 10 most recent tweet ids in the user's news feed. Each item in the news feed must be posted by users who the user followed or by the user herself. Tweets must be ordered from most recent to least recent. */
vector<int> getNewsFeed(int userId) {
set<int> tmp_set;
if (follower_mp.find(userId) != follower_mp.end()) {
tmp_set = follower_mp[userId];
}
tmp_set.insert(userId); vector<pair<int, int> > result; set<int>::iterator itr = tmp_set.begin();
for (; itr != tmp_set.end(); ++itr) {
if (twitter_self_mp.find(*itr) == twitter_self_mp.end()) {
continue;
} int curPos = ;
int curSize = result.size(); vector<pair<int, int> > tmp_vec = twitter_self_mp[*itr];
vector<pair<int, int> >::iterator vitr = tmp_vec.begin(); for (; vitr != tmp_vec.end() && curPos < ; ++vitr) {
while (curPos < && curPos < curSize &&
result[curPos].first > vitr->first) { curPos++;
} if (curPos >= ) {
break;
} result.insert(result.begin() + curPos,
*vitr);
curPos++;
curSize++;
}
} vector<int> ret;
int rlen = result.size();
for (int i=; i< && i<rlen; ++i) {
ret.push_back(result[i].second);
}
return ret; } /** Follower follows a followee. If the operation is invalid, it should be a no-op. */
void follow(int followerId, int followeeId) {
if (follower_mp.find(followerId) == follower_mp.end()) {
set<int> tmp_set;
follower_mp[followerId] = tmp_set;
}
follower_mp[followerId].insert(followeeId); if (followee_mp.find(followeeId) == followee_mp.end()) {
set<int> tmp_set;
followee_mp[followeeId] = tmp_set;
}
followee_mp[followeeId].insert(followerId); } /** Follower unfollows a followee. If the operation is invalid, it should be a no-op. */
void unfollow(int followerId, int followeeId) {
if (follower_mp.find(followerId) != follower_mp.end() &&
follower_mp[followerId].find(followeeId) != follower_mp[followerId].end()) {
follower_mp[followerId].erase(followeeId);
} if (followee_mp.find(followeeId) != followee_mp.end() &&
followee_mp[followeeId].find(followerId) != followee_mp[followeeId].end()) {
followee_mp[followeeId].erase(followerId);
} }
}; /**
* Your Twitter object will be instantiated and called as such:
* Twitter obj = new Twitter();
* obj.postTweet(userId,tweetId);
* vector<int> param_2 = obj.getNewsFeed(userId);
* obj.follow(followerId,followeeId);
* obj.unfollow(followerId,followeeId);
*/

最新文章

  1. 【转】 NoSQL初探之人人都爱Redis:(4)Redis主从复制架构初步探索
  2. 网络(一),libevent客户端部分
  3. C++: 单例模式和缺陷
  4. unix c 03
  5. UILabel可以显示html文本
  6. MongoDB的$type操作符
  7. openstack pike 使用 openvswitch + vxlan
  8. Spring Cloud Zuul网关 Filter、熔断、重试、高可用的使用方式。
  9. IO (四)
  10. JQuery --- 第三期 (jQuery事件相关)
  11. ASP.NET MVC 企业级实战
  12. bootstrap-typeahead 自动补全简单的使用教程
  13. ActiveMQ嵌入Tomcat
  14. .NET Core 2.1中的分层编译(预览)
  15. 为DBNavigator的按钮加中文
  16. 昨天办了一张地铁卡,我想到一个app
  17. pta l3-3(社交集群)
  18. JTemplate学习(三)
  19. android data recovery and nc
  20. IOS http 请求

热门文章

  1. Mysql自增语句
  2. oneDay
  3. curl_get和curl_post,伪造请求头,绕过防盗链下载文件
  4. 【51Nod 1222】最小公倍数计数
  5. 【spfa】【动态规划】zoj3847 Collect Chars
  6. Git 简易使用指南及补充
  7. PYQT设计无边框窗体
  8. Codeforces Round #FF (Div. 1) A. DZY Loves Sequences 动态规划
  9. 洛谷OJ U552 守墓人 线段树模板题
  10. JDK篇