Design Twitter

看了网上其他人的做法，感觉如果，不设计特别的user和tweet类，自己的做法是最优的。但当中瓶颈出在第一次对tweetList的遍历，如果tweetList很大，而且前面的tweet都是无关的，会有很大的时间浪费。如果，设计了user和tweet类，就只遍历相关的tweet，会省不少时间。这个如果遇到了，就问清楚，到底要一个简单能用的，还是复杂完备的设计。

public class Twitter {

    Map<Integer/*userId*/, Set<Integer/*userId*/>> userMap = null;
    Map<Integer/*tweetId*/, Integer/*userId*/> tweetUserMap = null;
    List<Integer/*tweetId*/> tweetList = null;

    /** Initialize your data structure here. */
    public Twitter() {
        userMap = new HashMap<>();
        tweetUserMap = new HashMap<>();
        tweetList = new LinkedList<>();
    }
    
    /** Compose a new tweet. */
    public void postTweet(int userId, int tweetId) {
        if (!userMap.containsKey(userId)) {
            userMap.put(userId, new HashSet<>());
        }
        tweetUserMap.put(tweetId, userId);
        tweetList.add(0, 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> res = new LinkedList<>();
        int count = 0;
        for (int tweetId: tweetList) {
            if (count == 10) {
                break;
            }
            int posterId = tweetUserMap.get(tweetId);
            if (posterId == userId) {
                count++;
                res.add(tweetId);
            } else {
                Set<Integer> followeeSet = userMap.get(userId);
                //if (followeeSet.contains(posterId)) {
                if (followeeSet != null && followeeSet.contains(posterId)) {
                    count++;
                    res.add(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)) {
            Set<Integer> followeeSet = userMap.get(followerId);
            followeeSet.add(followeeId);
        } else {
            Set<Integer> followeeSet = new HashSet<>();
            followeeSet.add(followeeId);
            userMap.put(followerId, followeeSet);
        }
    }
    
    /** 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)) {
            Set<Integer> followeeSet = userMap.get(followerId);
            followeeSet.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);
 */

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