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

解题思路：

题目本身不难，主要是代码量较大，而且要注意一些不合法的情况，比如follow或者unfollow操作的两个id相同，以及follow操作的id已经follow过。

AC代码如下：

class Tweet{
	static int time;
public:
	int userId;
	int tweetId;
	int times;
	Tweet(){}
	Tweet(int u, int t) :userId(u), tweetId(t){ times = time++; }
};
bool cmp(const Tweet& a, const Tweet& b){
	return a.times < b.times;
}
int Tweet::time = 0;

class Node{
public:
	int userId;
	unordered_set<int> followee;
	unordered_set<int> follower;
	vector<Tweet> tweets;
	Node(){}
	Node(int u) :userId(u){}
};

class Twitter {
public:
	/** Initialize your data structure here. */
	Twitter() {

	}

	/** Compose a new tweet. */
	void postTweet(int userId, int tweetId) {
		if (m_users.find(userId) == m_users.end()){
			Node tmp = Node(userId);
			tmp.tweets.push_back(Tweet(userId, tweetId));
			m_users[userId] = tmp;
		}
		else{
			Tweet tweet = Tweet(userId, tweetId);
			m_users[userId].tweets.push_back(tweet);
			unordered_set<int>::iterator it = m_users[userId].follower.begin();
			for (; it != m_users[userId].follower.end(); ++it){
				m_users[*it].tweets.push_back(tweet);
			}
		}
	}

	/** 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) {
		if (m_users.find(userId) == m_users.end()){
			Node tmp = Node(userId);
			m_users[userId] = tmp;
		}
		vector<int> ans;
		vector<Tweet> tmp = m_users[userId].tweets;
		sort(tmp.begin(), tmp.end(), cmp);
		for (int i = 0, j = tmp.size() - 1; i < 10 && j >= 0; ++i, --j){
			ans.push_back(tmp[j].tweetId);
		}
		return ans;

	}

	/** Follower follows a followee. If the operation is invalid, it should be a no-op. */
	void follow(int followerId, int followeeId) {
		if (followerId == followeeId) return;
		if (m_users.find(followerId) == m_users.end()){
			Node tmp = Node(followerId);
			m_users[followerId] = tmp;
		}
		if (m_users.find(followeeId) == m_users.end()){
			Node tmp = Node(followeeId);
			m_users[followeeId] = tmp;
		}
		if (m_users[followerId].followee.find(followeeId) != m_users[followerId].followee.end()) return;
		m_users[followerId].followee.insert(followeeId);
		m_users[followeeId].follower.insert(followerId);
		vector<Tweet>::iterator it = m_users[followeeId].tweets.begin();
		for (; it != m_users[followeeId].tweets.end(); ++it){
			if (it->userId == followeeId)
				m_users[followerId].tweets.push_back(*it);
		}
	}

	/** Follower unfollows a followee. If the operation is invalid, it should be a no-op. */
	void unfollow(int followerId, int followeeId) {
		if (followerId == followeeId) return;
		if (m_users.find(followerId) == m_users.end()){
			Node tmp = Node(followerId);
			m_users[followerId] = tmp;
		}
		if (m_users.find(followeeId) == m_users.end()){
			Node tmp = Node(followeeId);
			m_users[followeeId] = tmp;
		}
		if (m_users[followerId].followee.find(followeeId) != m_users[followerId].followee.end()){
			m_users[followerId].followee.erase(followeeId);
			m_users[followeeId].follower.erase(followerId);
			vector<Tweet>::iterator it = m_users[followerId].tweets.begin();
			for (; it != m_users[followerId].tweets.end();){
				if (it->userId == followeeId) it = m_users[followerId].tweets.erase(it);
				else{
					++it;
				}
			}
		}
	}
private:
	unordered_map<int, Node> m_users;
};