码迷,mamicode.com
首页 > 其他好文 > 详细

LeetCode 1348. Tweet Counts Per Frequency

时间:2020-02-09 20:33:31      阅读:75      评论:0      收藏:0      [点我收藏+]

标签:you   name   ==   return   call   min   new t   i++   led   

题目

不想多说

class TweetCounts {
     
public:
    map<string,multiset<int>> m;
    TweetCounts() {
        m.clear();
    }
    
    void recordTweet(string tweetName, int time) {
        m[tweetName].insert(time);
    }
    
    vector<int> getTweetCountsPerFrequency(string freq, string tweetName, int startTime, int endTime) {
        int inter = freq=="minute"?60:(freq=="hour"?60*60:60*60*24);
        vector<int> ans;
        for(int i=0;i<(endTime-startTime)/inter+1;i++)
        {
            ans.push_back(0);
        }
        for(multiset<int>::iterator iter=m[tweetName].begin();iter!=m[tweetName].end();++iter)
        {
            if(*iter>endTime)
                break;
            if(*iter>=startTime){
                int x = (*iter - startTime)/inter;
                ans[x]++;
            }
        }
        return ans;
    }
  
};

/**
 * Your TweetCounts object will be instantiated and called as such:
 * TweetCounts* obj = new TweetCounts();
 * obj->recordTweet(tweetName,time);
 * vector<int> param_2 = obj->getTweetCountsPerFrequency(freq,tweetName,startTime,endTime);
 */

LeetCode 1348. Tweet Counts Per Frequency

标签:you   name   ==   return   call   min   new t   i++   led   

原文地址:https://www.cnblogs.com/dacc123/p/12288351.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!