[leetcode-355]Design Twitter(java)

思路:想法很简单,维护一个人员表,维护一个twitter表

代码如下:

public class Twitter {
    class TwitterNode{
        int userId;
        int twitterId;
        TwitterNode(int userId,int twitterId){
            this.userId = userId;
            this.twitterId = twitterId;
        }
    }

    List<TwitterNode> twitterList;
    Map<Integer,Set> userManager;
    /** Initialize your data structure here. */
    public Twitter() {
        twitterList = new LinkedList<TwitterNode>();
        userManager = new HashMap<Integer,Set>();
    }

    /** Compose a new tweet. */
    public void postTweet(int userId, int tweetId) {
        if(!userManager.containsKey(userId)){
            Set<Integer> tmp = new HashSet<>();
            tmp.add(userId);
            userManager.put(userId,tmp);
        }
        TwitterNode node = new TwitterNode(userId,tweetId);
        twitterList.add(0,node);
    }

    /** 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<>();
        if(userManager.containsKey(userId)){
            Set<Integer> follows = userManager.get(userId);
            int count = 0;
            for(TwitterNode curNode:twitterList){
                if(count == 10)
                    break;
                if(follows.contains(curNode.userId)){
                    res.add(curNode.twitterId);
                    count++;
                }
            }
        }
        return res;
    }

    /** Follower follows a followee. If the operation is invalid, it should be a no-op. */
    public void follow(int followerId, int followeeId) {
        Set<Integer> focusSet;
        if(!userManager.containsKey(followeeId)){//必须包含被关注者
            focusSet = new HashSet<>();
            focusSet.add(followeeId);
            userManager.put(followeeId,focusSet);
        }
        if(!userManager.containsKey(followerId)){
            focusSet = new HashSet<>();
            focusSet.add(followerId);
            userManager.put(followerId,focusSet);           
        }
        userManager.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(followerId != followeeId && userManager.containsKey(followerId)){
            if(userManager.containsKey(followeeId)){
                userManager.get(followerId).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);
 */
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值