leetcode 355. Design Twitter | 355. 设计推特（Java）

本文主要是介绍leetcode 355. Design Twitter | 355. 设计推特（Java），对大家解决编程问题具有一定的参考价值，需要的程序猿们随着小编来一起学习吧！

题目

https://leetcode.com/problems/design-twitter/

题解

这题不难，就是业务代码。。写就是了。不知道为啥是 medium 题。

class Twitter {
    public static class Feed {
        int userId;
        int tweetId;

        public Feed(int userId, int tweetId) {
            this.userId = userId;
            this.tweetId = tweetId;
        }
    }

    List<Feed> tweetList;
    Map<Integer, Set<Integer>> followMap;

    /**
     * Initialize your data structure here.
     */
    public Twitter() {
        tweetList = new ArrayList<>();
        followMap = new HashMap<>();
    }

    /**
     * Compose a new tweet.
     */
    public void postTweet(int userId, int tweetId) {
        tweetList.add(new Feed(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) {
        Set<Integer> follows;
        if (followMap.containsKey(userId)) {
            follows = followMap.get(userId);
        } else {
            follows = new HashSet<>();
        }
        follows.add(userId);
        ArrayList<Integer> feedList = new ArrayList<>();
        for (int i = tweetList.size() - 1; i >= 0; i--) {
            if (follows.contains(tweetList.get(i).userId)) {
                feedList.add(tweetList.get(i).tweetId);
                if (feedList.size() == 10) return feedList;
            }
        }
        return feedList;
    }

    /**
     * Follower follows a followee. If the operation is invalid, it should be a no-op.
     */
    public void follow(int followerId, int followeeId) {
        Set<Integer> followSet;
        if (!followMap.containsKey(followerId)) {
            followSet = new HashSet<>();
        } else {
            followSet = followMap.get(followerId);
        }
        followSet.add(followeeId);
        followMap.put(followerId, followSet);
    }

    /**
     * Follower unfollows a followee. If the operation is invalid, it should be a no-op.
     */
    public void unfollow(int followerId, int followeeId) {
        if (followMap.containsKey(followerId)) {
            followMap.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);
 */

这篇关于leetcode 355. Design Twitter | 355. 设计推特（Java）的文章就介绍到这儿，希望我们推荐的文章对大家有所帮助，也希望大家多多支持为之网！