中级农民
- 积分
- 104
- 大米
- 颗
- 鳄梨
- 个
- 水井
- 尺
- 蓝莓
- 颗
- 萝卜
- 根
- 小米
- 粒
- 学分
- 个
- 注册时间
- 2018-5-29
- 最后登录
- 1970-1-1
|
CPP solution:
- #include <vector>
- #include <utility>
- #include <algorithm>
- #include <unordered_map>
- #include <string>
- #include <iostream>
- using namespace std;
- class Solution {
- public:
- Solution() {
- open_hours.resize(7);
- names[0] = "Mon ";
- names[1] = "Tue ";
- names[2] = "Wed ";
- names[3] = "Thur";
- names[4] = "Fri ";
- names[5] = "Sat ";
- names[6] = "Sun ";
- }
- void addTime(vector<int> open_time) {
- int day = open_time[0], open = open_time[1], close = open_time[2];
- if(close > open) {
- open_hours[day].push_back({open, close});
- open_hours[day] = mergeIntervals(open_hours[day]);
- } else {
- open_hours[day].push_back({open, 1440});
- open_hours[(day + 1) % 7].push_back({0, close});
- open_hours[day] = mergeIntervals(open_hours[day]);
- open_hours[(day + 1) % 7] = mergeIntervals(open_hours[(day + 1) % 7]);
- }
- };
- vector<pair<int, int>> mergeIntervals(vector<pair<int, int>> &intervals) {
- int n = intervals.size();
- if(n <= 1) return intervals;
- sort(intervals.begin(), intervals.end());
- vector<pair<int, int>> ans;
- int start = intervals[0].first, end = intervals[0].second;
- for(int i = 1; i < n; i++) {
- int x = intervals[i].first, y = intervals[i].second;
- if(x <= end) {
- end = max(y, end);
- } else {
- ans.push_back({start, end});
- start = x; end = y;
- }
- }
- ans.push_back({start, end});
- return ans;
- }
- bool isOpen(int day, int time_mins) {
- for(auto &interval : open_hours[day]) {
- if(interval.first >= time_mins) return true;
- }
- return false;
- };
- string minsToString(int time_mins) {
- string h = to_string(time_mins / 60);
- string m = to_string(time_mins % 60);
- if(h.size() == 1) h = "0" + h;
- if(m.size() == 1) m = "0" + m;
- return h + ":" + m;
- }
- void printOpenHours() {
- for(int day = 0; day <= 6; day++) {
- cout << names[day] << ": ";
- for(auto &interval : open_hours[day]) {
- string open = minsToString(interval.first);;
- string close = minsToString(interval.second);
- cout << open << " -> " << close << " ";
- }
- cout << endl;
- }
- }
- private:
- vector< vector<pair<int, int>>> open_hours;
- unordered_map<int, string> names;
- };
- int main(void) {
- Solution sl;
- sl.addTime({0, 9 * 60, 15 * 60 } );
- sl.addTime({1, 9 * 60, 15 * 60 } );
- sl.addTime({2, 9 * 60, 15 * 60 } );
- sl.addTime({3, 9 * 60, 15 * 60 } );
- sl.addTime({3, 9 * 60, 4 * 60 } );
- sl.addTime({4, 9 * 60, 2 * 60 } );
- sl.addTime({5, 9 * 60, 15 * 60} );
- sl.addTime({6, 9 * 60, 15 * 60} );
- sl.printOpenHours();
- return 0;
- }
复制代码
|
|