首页 > 代码库 > 355. Design Twitter [classic design]
355. Design Twitter [classic design]
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);
public class Twitter { int timeStamp = 0; Map<Integer, User> map; class Tweet { int id; int time; Tweet next; public Tweet (int id){ this.id = id; time = timeStamp++; next = null; } } class User { int id; Set<Integer> followed; Tweet tweet_head; public User(int id){ this.id = id; followed = new HashSet<>(); followed.add(id); tweet_head = null; } public void follow(int id){ followed.add(id); } public void unfollow(int id){ followed.remove(id); } public void post(int id){ Tweet t = new Tweet(id); t.next = tweet_head; tweet_head = t; } } /** Initialize your data structure here. */ public Twitter() { map = new HashMap<>(); } /** Compose a new tweet. */ public void postTweet(int userId, int tweetId) { if(!map.containsKey(userId)){ User user = new User(userId); map.put(userId, user); } map.get(userId).post(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 ArrayList<>(); if(!map.containsKey(userId)) return res; PriorityQueue<Tweet> pq = new PriorityQueue<Tweet>(new Comparator<Tweet>(){ public int compare(Tweet a , Tweet b){ return b.time - a.time; } }); for(Integer user : map.get(userId).followed){ Tweet t = map.get(user).tweet_head; if(t != null){ pq.add(t); } } int n = 0; while(!pq.isEmpty() && n < 10){ Tweet t = pq.poll(); res.add(t.id); n++; if(t.next != null) pq.add(t.next); } 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(!map.containsKey(followerId)){ User user = new User(followerId); map.put(followerId, user); } if(!map.containsKey(followeeId)){ User user = new User(followeeId); map.put(followeeId, user); } map.get(followerId).follow(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) || !map.containsKey(followeeId) || followerId == followeeId ) return ; map.get(followerId).unfollow(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); */
355. Design Twitter [classic design]
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。