355. Design Twitter


Design a simplified version of Twitter where users can post tweets, follow/unfollow another user and is able to see the 10 most recent tweets in the user’s news feed. Your design should support the following methods:

postTweet(userId, tweetId): Compose a new tweet.
getNewsFeed(userId): 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.
follow(followerId, followeeId): Follower follows a followee.
unfollow(followerId, followeeId): Follower unfollows a followee.

Example:

Twitter twitter = new Twitter();

// User 1 posts a new tweet (id = 5).
twitter.postTweet(1, 5);

// User 1's news feed should return a list with 1 tweet id -> [5].
twitter.getNewsFeed(1);

// User 1 follows user 2.
twitter.follow(1, 2);

// User 2 posts a new tweet (id = 6).
twitter.postTweet(2, 6);

// User 1's news feed should return a list with 2 tweet ids -> [6, 5].
// Tweet id 6 should precede tweet id 5 because it is posted after tweet id 5.
twitter.getNewsFeed(1);

// User 1 unfollows user 2.
twitter.unfollow(1, 2);

// User 1's news feed should return a list with 1 tweet id -> [5],
// since user 1 is no longer following user 2.
twitter.getNewsFeed(1);

方法1: hash + hash

思路:

采用两个hash:一个user_hash记录{user: vector<\string> following}(注意这个tweet_hash里应该包括user本身,user一直follow 着自己), 一个用来记录{user: vector<\string> tweets}. 注意这个tweet可能需要一个timestamp,因为在输出时需要按照时间逆序排列,所以干脆使用一个map而不是vector来做key,map的第一个值用来记录post的时间,那么这个map就会自动按时间排序,第二个值记录着tweetId。
postTweet(userId, tweetId): 将tweetId加到userId的hash中
getNewsFeed(userId):遍历包括userId在内的所有following,对于每一个人,从tweet_hash中提取他们名下的所有tweets, 用一个priority_queue 来维持一个最近的k个post
follow(followerId, followeeId): 在hash中,followerId中加入followeeId
unfollow(followerId, followeeId):在hash中,followerId中消掉followeeId

易错点

  1. postTweet这个命令有两个容易错的地方:1. 每次post一个tweet的时候,都要将class内部的time++,来enforce post之间的相对顺序。注意这里绝对时间并不重要,所以time的含义更像是一个tick,参见LFU那道题。2. 由于初始的时候friends里面是空的,只有当follow命令执行的时候我们才会想friends当中加入following。但是想象如果在postTweet下一个操作就是getNewsFeed,此时userId至少应该能看见自己刚post出去的东西。因此在post之前,要进行一次follow(userId, userId) 的操作。实际上,这个操作只有在第一次post的时候有效,后面的被set的去重功能给抵消了。
  2. getNewsFeed注意逆序排列
  3. unfollow的坑:test里面会出现unfollow(1, 1),但是我们是不允许unfollow自己的。因此判断一下followerId != followeeId.

Complexity

class Twitter {
private:
    int time;
    unordered_map<int, unordered_set<int>> friends;
    unordered_map<int, map<int, int>> tweets;
public:
    /** Initialize your data structure here. */
    Twitter() {
        time = 0;
    }
    
    /** Compose a new tweet. */
    void postTweet(int userId, int tweetId) {
        follow(userId, userId);
        tweets[userId].insert({time++, 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) {
        map<int, int> top10;
        for (auto id: friends[userId]){
            for (auto tw: tweets[id]) {
                top10[tw.first] = tw.second;
                if (top10.size() > 10) {
                    top10.erase(top10.begin());
                }
            }
        }
        vector<int> result;
        for (auto item: top10) {
            result.insert(result.begin(), item.second);
        }
        return result;
    }
    
    /** Follower follows a followee. If the operation is invalid, it should be a no-op. */
    void follow(int followerId, int followeeId) {
        friends[followerId].insert(followeeId);
    }
    
    /** Follower unfollows a followee. If the operation is invalid, it should be a no-op. */
    void unfollow(int followerId, int followeeId) {
        if (followerId != followeeId){
            friends[followerId].erase(followeeId);
        }
    }
};

/**
 * 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);
 */
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值