Leetcode 355. Design Twitter

最新推荐文章于 2022-09-12 20:41:31 发布

sundawei2016

最新推荐文章于 2022-09-12 20:41:31 发布

阅读量251

点赞数

分类专栏： Leetcode

本文链接：https://blog.csdn.net/sundawei2016/article/details/74082977

版权

Leetcode 专栏收录该内容

83 篇文章 0 订阅

订阅专栏

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.

用一个NUM 来记录这是第几条tweet

users 是关于用户和用户关注的用户的映射

tweets 是用户和用户发的tweet 的映射

public class Twitter {
    int NUM = 0;
    Map<Integer, Set<Integer>> users;  // user --> user follow list
    Map<Integer, List<Tweet>> tweets; // user -->  users' tweets
    
    public class Tweet {
        int userId;
        int tweetId;
        int num;
        public Tweet(int userId, int tweetId) {
            this.userId = userId;
            this.tweetId = tweetId;
            this.num = NUM++;
        }
    }

    public Twitter() {
        users = new HashMap<>();
        tweets = new HashMap<>();
    }
    
    public void postTweet(int userId, int tweetId) {
        if (!tweets.containsKey(userId)) tweets.put(userId, new LinkedList<Tweet>());
        tweets.get(userId).add(new Tweet(userId, tweetId));
    }
    
    public List<Integer> getNewsFeed(int userId) {
        PriorityQueue<Tweet> pq = new PriorityQueue<Tweet>((t1, t2) -> t1.num - t2.num);
	    Set<Integer> follow = users.get(userId) == null ? new HashSet<Integer>() : users.get(userId);
	    follow.add(userId);
	    for (int uid : follow) {
		    List<Tweet> temp = tweets.get(uid);
		    if (temp != null) {
			    for (Tweet t : temp) {
				    if (pq.size() < 10) pq.add(t);
				    else {
					    if (t.num > pq.peek().num) {
						    pq.poll();
						    pq.add(t);
					    }
				    }
			    }
		    }
	    }
	    int count = 0;
	    LinkedList<Integer> list = new LinkedList<Integer>();
	    while (!pq.isEmpty() && count++ < 10) {
		    list.addFirst(pq.poll().tweetId);
	    }
	    return list;
    }
    
    public void follow(int followerId, int followeeId) {
        if (!users.containsKey(followerId)) users.put(followerId, new HashSet<Integer>());
        users.get(followerId).add(followeeId);
    }
    
    public void unfollow(int followerId, int followeeId) {
        if (users.containsKey(followerId)) {
		    if (users.get(followerId).contains(followeeId)) {
			    users.get(followerId).remove(followeeId);
		    }
	    }
    }
}