Leetcode: 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);

注意需要maintain一个time stamp, 每次postTweet时++。还有要注意unfollow的时候，不能unfollow自己

public class Twitter {
    class User {
        int userId;
        List<Tweet> tweets;
        Set<Integer> followees;
        public User(int id) {
            this.userId = id;
            this.tweets = new ArrayList<Tweet>();
            this.followees = new HashSet<Integer>();
            followees.add(id);
        }
    }
    
    class Tweet {
        int tweetId;
        int seq;
        public Tweet(int id, int num) {
            this.tweetId = id;
            this.seq = num;
        }
    }
    
    Map<Integer, User> userMap;
    PriorityQueue<Tweet> maxHeap;
    int seq;

    /** Initialize your data structure here. */
    public Twitter() {
        userMap = new HashMap<Integer, User>();
        maxHeap = new PriorityQueue<Tweet>(11, new Comparator<Tweet>() {
            public int compare(Tweet t1, Tweet t2) {
                return t2.seq-t1.seq;
            }
        });
        this.seq = 0;
    }
    
    /** Compose a new tweet. */
    public void postTweet(int userId, int tweetId) {
        if (!userMap.containsKey(userId)) {
            User newUser = new User(userId);
            userMap.put(userId, newUser);
        }
        User curUser = userMap.get(userId);
        curUser.tweets.add(new Tweet(tweetId, ++this.seq));
    }
    
    /** 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. */
    public List<Integer> getNewsFeed(int userId) {
        List<Integer> res = new ArrayList<Integer>();
        if (!userMap.containsKey(userId)) return res;
        User curUser = userMap.get(userId);
        maxHeap.clear();
        for (int followeeId : curUser.followees) {
            List<Tweet> followeeTweets = userMap.get(followeeId).tweets;
            for (Tweet tweet : followeeTweets) {
                maxHeap.offer(tweet);
            }
        }
        for (int i=0; i<10 && !maxHeap.isEmpty(); i++) {
            res.add(maxHeap.poll().tweetId);
        }
        return res;
    }
    
    /** Follower follows a followee. If the operation is invalid, it should be a no-op. */
    public void follow(int followerId, int followeeId) {
        if (!userMap.containsKey(followerId)) {
            User newUser = new User(followerId);
            userMap.put(followerId, newUser);
        }
        if (!userMap.containsKey(followeeId)) {
            User newUser = new User(followeeId);
            userMap.put(followeeId, newUser);
        }
        userMap.get(followerId).followees.add(followeeId);
    }
    
    /** Follower unfollows a followee. If the operation is invalid, it should be a no-op. */
    public void unfollow(int followerId, int followeeId) {
        if (!userMap.containsKey(followerId)) {
            User newUser = new User(followerId);
            userMap.put(followerId, newUser);
        }
        if (!userMap.containsKey(followeeId)) {
            User newUser = new User(followeeId);
            userMap.put(followeeId, newUser);
        }
        if (followerId != followeeId)
            userMap.get(followerId).followees.remove(followeeId);        
    }
}

/**
 * Your Twitter object will be instantiated and called as such:
 * Twitter obj = new Twitter();
 * obj.postTweet(userId,tweetId);
 * List<Integer> param_2 = obj.getNewsFeed(userId);
 * obj.follow(followerId,followeeId);
 * obj.unfollow(followerId,followeeId);
 */

关于PriorityQueue还看到这一种写法，挺简单的：

 Set<Integer> users = userMap.get(userId).followed;

 PriorityQueue<Tweet> q = new PriorityQueue<Tweet>(users.size(), (a,b)->(b.time-a.time));