design twitter 设计微博实现

这里注意map 是不用调用结构体中的析构函数的 要自己定义

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

/* 设计推特
 * 功能： 发推特 关注 取关 3.获取一个人级他的关注着最近的10条微博
 * 功能3 用合并链表k实现 即建立一个大小为min(sumtweet, 10)的堆 每次pop一个 push一个
 *
 * */
class Blog{
public:
    int id, time;
    Blog *next;
    Blog(int _id, int _time):next(NULL), id(_id), time(_time){}
    void insert(Blog* tmp){
        tmp->next = this->next;
        this->next = tmp;
    }
};
class User{
public:
    set<int> follower;
    Blog *tweets;
    User():tweets(new Blog(-1,0)){}
    ~User(){
        auto p=tweets, tmp=tweets;
        while(p){
            tmp = p->next;
            delete(p);
            p = tmp;
        }
    }
};
class Twitter {
public:
    unordered_map<int, User*> database;
    int time;
    /** Initialize your data structure here. */
    Twitter():time(0) {}
// get error:
    ~Twitter(){
        for(auto &m:database){
            //delete(m.second);
            delete(m.second);
        }
    }

    User* validuser(int userId, bool needadd=true){
        auto it = database.find(userId);
        if(it != database.end())    return it->second;
        else if(!needadd)   return NULL;
        auto user = new User();
        database[userId] = user;
        return user;
    }
    void postTweet(int userId, int tweetId) {
        auto user = validuser(userId);
        user->tweets->insert(new Blog(tweetId, time++));
    }

    /** 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. */
    vector<int> getNewsFeed(int userId) {
        if(!validuser(userId, false)) return {};
        vector<int> ret;
        auto user = database[userId];
        auto f = [](Blog *&A, Blog *&B){return A->time < B->time;};
        priority_queue<Blog*, vector<Blog*>, decltype(f)> q(f);
        if(user->tweets->next)   q.push(user->tweets->next);
        for(auto &p:user->follower){
            //cout<<p<<endl;
            auto tmp=database[p]->tweets->next;
            if(tmp) q.push(tmp);
        }
        for(int i=0;i<10 && !q.empty();i++){
            auto tmp=q.top();q.pop();
            ret.push_back(tmp->id);
            if(tmp->next)   q.push(tmp->next);
        }
        return ret;
    }

    /** Follower follows a followee. If the operation is invalid, it should be a no-op. */
    void follow(int followerId, int followeeId) {
        if(followerId == followeeId)    return;
        User *follower=validuser(followerId), *followee=validuser(followeeId);
        if(followerId != followeeId)
            database[followerId]->follower.insert(followeeId);
    }

    /** Follower unfollows a followee. If the operation is invalid, it should be a no-op. */
    void unfollow(int followerId, int followeeId) {
        User *follower=validuser(followerId, false), *followee=validuser(followeeId, false);
        if(follower && followee){
            follower->follower.erase(followeeId);
        }
    }
};