[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:

1. postTweet(userId, tweetId): Compose a new tweet.
2. 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.
3. follow(followerId, followeeId): Follower follows a followee.
4. 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);

代码如下：

public class Twitter {
	int timestamp=0;
	HashMap<Integer,User> map;
	
	class User{
		int id;
		HashSet<User> follows;
		HashSet<Tweet> tweets;
		public User(int id) {
			this.id = id;
			follows = new HashSet<User>();;
			tweets = new HashSet<Tweet>();
		}
	}
	class Tweet implements Comparable<Tweet>{
		int id;
		int time;
		@Override
		public int compareTo(Tweet o) {
			return o.time-time;
		}
		public Tweet(int id) {
			this.id = id;
			this.time=timestamp++;;
		}
	}
	
    /** Initialize your data structure here. */
    public Twitter() {
    	map=new HashMap<Integer,User>();
    }
    
    /** Compose a new twe	et. */
    public void postTweet(int userId, int tweetId) {
    	if(!map.containsKey(userId)){
    		User u=new User(userId);
    		map.put(userId,u);
    	}
    	map.get(userId).tweets.add(new Tweet(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. */
    public List<Integer> getNewsFeed(int userId) {
    	List<Integer> re=new ArrayList<Integer>();
    	if(!map.containsKey(userId)) return re;
    	PriorityQueue<Tweet> queue=new PriorityQueue<Tweet>(10);
    	User u=map.get(userId);
    	for(Tweet t:u.tweets) queue.add(t);
    	for(User user:u.follows){
    		for(Tweet t:user.tweets) queue.add(t);
    	}
    	while(!queue.isEmpty()&&re.size()<10) re.add(queue.poll().id);
    	return re;
    }
    
    /** Follower follows a followee. If the operation is invalid, it should be a no-op. */
    public void follow(int followerId, int followeeId) {
    	if(!map.containsKey(followerId)){
    		User u=new User(followerId); map.put(followerId,u);
    	}
    	if(!map.containsKey(followeeId)){
    		User u=new User(followeeId); map.put(followeeId,u);
    	}
        if(followerId==followeeId) return;
    	map.get(followerId).follows.add(map.get(followeeId));
    }
    
    /** Follower unfollows a followee. If the operation is invalid, it should be a no-op. */
    public void unfollow(int followerId, int followeeId) {
    	if(!map.containsKey(followerId)){
    		User u=new User(followerId); map.put(followerId,u);
    	}
    	if(!map.containsKey(followeeId)){
    		User u=new User(followeeId); map.put(followeeId,u);
    	}
    	map.get(followerId).follows.remove(map.get(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);
 */