leetcode 355. 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);

 


 

因为要互相关注,所以用HashMap存关注关系。又要求消息时间顺序,所以用id区别先后顺序,把id,userId,tweetId放到一个类里。取最近消息要用到优先队列。

 

class Twitter {
    int id=-10000000;//用标记消息的顺序
    HashMap<Integer,HashSet<Integer>> follow;
    HashMap<Integer,LinkedList<Tweet>> news;//userId —— 消息
    
    /** Initialize your data structure here. */
    public Twitter() {
        follow=new HashMap<>(); 
        news=new HashMap<>();
    }
    
    /** Compose a new tweet. */
    public void postTweet(int userId, int tweetId) {
        if(news.get(userId)==null) news.put(userId,new LinkedList<Tweet>());
        news.get(userId).addFirst(new Tweet(id++,userId,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<>();
        PriorityQueue<Tweet> pq=new PriorityQueue<>(new Comparator<Tweet>(){//放入消息
            public int compare(Tweet t1,Tweet t2){
                return t2.id-t1.id;
            }
        });
        //自己的消息
        if(news.get(userId)!=null&&news.get(userId).size()>0) pq.add(news.get(userId).get(0));
        
        //别人的消息,先由关注列表找到别人
        if(follow.get(userId)==null) follow.put(userId,new HashSet<Integer>());
        for(int uid:follow.get(userId)){
            if(news.get(uid)==null) news.put(uid,new LinkedList<Tweet>());   
            if(news.get(uid).size()>0) pq.add(news.get(uid).get(0));
        }
        
        for(int i=0;i<10&&pq.size()>0;i++){//找到他和他关注的人的前10条消息
            Tweet tweet=pq.poll();
            res.add(tweet.tweetId);
            LinkedList<Tweet> tweets=news.get(tweet.userId);
            Iterator<Tweet> it=tweets.iterator();
            //找下一个Tweet
            while(it.hasNext()){
                Tweet t=it.next();
                if(t==tweet) break;
            }
            if(it.hasNext()) pq.add(it.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(followerId==followeeId) return;
        if(follow.get(followerId)==null) follow.put(followerId,new HashSet<Integer>());
        follow.get(followerId).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(follow.get(followerId)==null) follow.put(followerId,new HashSet<Integer>());
        follow.get(followerId).remove(followeeId);
    }
    
    //消息
    class Tweet{
        int id;
        int userId;
        int tweetId;
        Tweet(int id,int userId,int tweetId){
            this.id=id;
            this.userId=userId;
            this.tweetId=tweetId;
        }
    }
}

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

 

 

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值