FriendShip Service

Support follow & unfollow, getFollowers, getFollowings.
Note: the results of getfollow() are sorted.

Example

follow(1, 3)
getFollowers(1) // return [3]
getFollowings(3) // return [1]
follow(2, 3)
getFollowings(3) // return [1,2]
unfollow(1, 3)
getFollowings(3) // return [2]

思路:TreeSet是已经排好序的set,直接用treeset去收集就可以了;

public class FriendshipService {
    private HashMap<Integer, Set<Integer>> followers, followings;
    public FriendshipService() {
        this.followers = new HashMap<Integer, Set<Integer>>();
        this.followings = new HashMap<Integer, Set<Integer>>();
    }

    /*
     * @param user_id: An integer
     * @return: all followers and sort by user_id
     */
    public List<Integer> getFollowers(int user_id) {
        if(!followers.containsKey(user_id)){
            return new ArrayList<Integer>();
        }
        return new ArrayList<Integer>(followers.get(user_id));
    }

    /*
     * @param user_id: An integer
     * @return: all followings and sort by user_id
     */
    public List<Integer> getFollowings(int user_id) {
        if(!followings.containsKey(user_id)) {
            return new ArrayList<Integer>();
        }
        return new ArrayList<Integer>(followings.get(user_id));
    }

    /*
     * @param from_user_id: An integer
     * @param to_user_id: An integer
     * @return: nothing
     */
    public void follow(int to_user_id, int from_user_id) {
        if(!followers.containsKey(to_user_id)){
            followers.put(to_user_id, new TreeSet<Integer>());
        }
        followers.get(to_user_id).add(from_user_id);
        
        if(!followings.containsKey(from_user_id)){
            followings.put(from_user_id, new TreeSet<Integer>());
        }
        followings.get(from_user_id).add(to_user_id);
    }

    /*
     * @param from_user_id: An integer
     * @param to_user_id: An integer
     * @return: nothing
     */
    public void unfollow(int to_user_id, int from_user_id) {
        if(followers.containsKey(to_user_id)){
            followers.get(to_user_id).remove(from_user_id);
        }
        if(followings.containsKey(from_user_id)){
            followings.get(from_user_id).remove(to_user_id);
        }
    }
}

 

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值