[LeetCode] 636. Exclusive Time of Functions
来源:互联网 发布:天津mac口红专柜 编辑:程序博客网 时间:2024/06/05 17:41
Given the running logs of n functions that are executed in a nonpreemptive single threaded CPU, find the exclusive time of these functions.
Each function has a unique id, start from 0 to n-1. A function may be called recursively or by another function.
A log is a string has this format : function_id:start_or_end:timestamp. For example, “0:start:0” means function 0 starts from the very beginning of time 0. “0:end:0” means function 0 ends to the very end of time 0.
Exclusive time of a function is defined as the time spent within this function, the time spent by calling other functions should not be considered as this function’s exclusive time. You should return the exclusive time of each function sorted by their function id.
Example 1:
Input:n = 2logs = ["0:start:0", "1:start:2", "1:end:5", "0:end:6"]Output:[3, 4]Explanation:Function 0 starts at time 0, then it executes 2 units of time and reaches the end of time 1. Now function 0 calls function 1, function 1 starts at time 2, executes 4 units of time and end at time 5.Function 0 is running again at time 6, and also end at the time 6, thus executes 1 unit of time. So function 0 totally execute 2 + 1 = 3 units of time, and function 1 totally execute 4 units of time.
Note:
Input logs will be sorted by timestamp, NOT log id.
Your output should be sorted by function id, which means the 0th element of your output corresponds to the exclusive time of function 0.
Two functions won’t start or end at the same time.
Functions could be called recursively, and will always end.
1 <= n <= 100
class Solution {public: vector<int> exclusiveTime(int n, vector<string>& logs) { vector<int> res(n, 0); stack<tuple<int, int, int>> stk; for (auto &log : logs) { // 解析log的数据 auto delim = log.find(':'); auto id = stoi(log.substr(0, delim)); log = log.substr(delim + 1); delim = log.find(':'); auto type = log.substr(0, delim); auto ts = stoi(log.substr(delim + 1)); // 第三个字段表示该任务内层嵌套任务所消耗的时间 if (type == "start") { stk.push(make_tuple(id, ts, 0)); } else { auto part = stk.top(); stk.pop(); res[get<0>(part)] += (ts - get<1>(part) + 1) - get<2>(part); if (!stk.empty()) get<2>(stk.top()) += (ts - get<1>(part) + 1); } } return res; }};
- [leetcode]636. Exclusive Time of Functions
- [LeetCode]636. Exclusive Time of Functions
- [LeetCode] 636. Exclusive Time of Functions
- leetcode 636. Exclusive Time of Functions
- 636. Exclusive Time of Functions
- 636. Exclusive Time of Functions
- LeetCode.636 Exclusive Time of Functions
- LeetCode636. Exclusive Time of Functions
- LeetCode 636 : Exclusive Time of Functions(python)
- leetcode 636. Exclusive Time of Functions 函数的单独运行时间
- Exclusive Time of Functions问题及解法
- Top 10 custom JavaScript functions of all time
- Windows MFC Time Functions
- Functions about time
- Some functions about time
- Compile-time Functions
- mysql 5.6 Date/Time Functions
- List of C functions
- AVL树C++实现
- c语言排序算法(所有的都是升序,冒泡排序、插入排序、快速排序、选择排序、希尔排序、堆排序 )
- 9
- 位运算
- 字段自身+1 SQL语句
- [LeetCode] 636. Exclusive Time of Functions
- 搭建自己的基于motion移动物体的监控系统
- 解读支付宝实现的步骤
- Sublime Text2中文乱码问题
- Java源码阅读之HashMap
- 2-SAT模板
- 由前序遍历和中序遍历重建二叉树
- 06.19 MySQL数据库备份(进阶)
- 三次贝塞尔拟合工具