[leetcode]636. Exclusive Time of Functions
来源:互联网 发布:网上商城源码 java 编辑:程序博客网 时间:2024/06/17 13:40
题目链接:https://leetcode.com/problems/exclusive-time-of-functions/#/description
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 {private:void parselog(string& s, int& log_id, int& time, string& cmd){int first = s.find(':');int second = s.find(':' , first + 1);log_id = stoi(s.substr(0, first));cmd = s.substr(first + 1, second - (first + 1));time = stoi(s.substr(second + 1));}public:vector<int> exclusiveTime(int n, vector<string>& logs) {vector<int> ret(n,0);stack<int> st;if (logs.empty())return ret;string cmd = "";int log_id = -1;int end_point = -1;int start_point = 0;parselog(logs[0], log_id, start_point, cmd);st.push(log_id);for (int j = 1 ; j < logs.size(); j++){parselog(logs[j], log_id, end_point, cmd);int working_time = end_point - start_point + (cmd == "end");//(1)ret[st.top()] += working_time;if (cmd == "start")st.push(log_id);else st.pop();start_point = end_point + (cmd == "end");//(2)}return ret;}};
- [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
- PAT甲 1102. Invert a Binary Tree (25)
- rigibody组件
- A+B
- mac paralles内 windows虚机 连接 linux虚机
- HDU2544 最短路
- [leetcode]636. Exclusive Time of Functions
- CNTK API文档翻译(11)——使用LSTM预测时间序列数据(物联网数据)
- Effective C++笔记(8)—继承与面向对象设计
- Nginx服务器对session的处理策略
- 不要以多态的方式处理数组
- python 调用super()初始化报错“TypeError: super() takes at least 1 argument”
- va_list va_start va_arg va_end 使用方法
- 怎么上传自己的代码到github上
- java泛型