leetcode

0 class Solution {

1 public:

2 long long taskSchedulerII(const vector<int> &tasks, int space) const {

3 unordered_map<int, long long> um;

4 long long day = 0;

5

6 for (const int t : tasks) {

7 um[t] = day = max(day, um[t] + space) + 1;

8 }

9

10 return day - space;

11 }

12 };