当前位置:网站首页>636. Exclusive Time of Functions
636. Exclusive Time of Functions
2022-06-23 08:24:00 【ujn20161222】
636. Exclusive Time of Functions
Medium
15622336Add to ListShare
On a single-threaded CPU, we execute a program containing n functions. Each function has a unique ID between 0 and n-1.
Function calls are stored in a call stack: when a function call starts, its ID is pushed onto the stack, and when a function call ends, its ID is popped off the stack. The function whose ID is at the top of the stack is the current function being executed. Each time a function starts or ends, we write a log with the ID, whether it started or ended, and the timestamp.
You are given a list logs, where logs[i] represents the ith log message formatted as a string "{function_id}:{"start" | "end"}:{timestamp}". For example, "0:start:3" means a function call with function ID 0 started at the beginning of timestamp 3, and "1:end:2" means a function call with function ID 1 ended at the end of timestamp 2. Note that a function can be called multiple times, possibly recursively.
A function's exclusive time is the sum of execution times for all function calls in the program. For example, if a function is called twice, one call executing for 2 time units and another call executing for 1 time unit, the exclusive time is 2 + 1 = 3.
Return the exclusive time of each function in an array, where the value at the ith index represents the exclusive time for the function with ID i.
Example 1:

Input: n = 2, logs = ["0:start:0","1:start:2","1:end:5","0:end:6"] Output: [3,4] Explanation: Function 0 starts at the beginning of time 0, then it executes 2 for units of time and reaches the end of time 1. Function 1 starts at the beginning of time 2, executes for 4 units of time, and ends at the end of time 5. Function 0 resumes execution at the beginning of time 6 and executes for 1 unit of time. So function 0 spends 2 + 1 = 3 units of total time executing, and function 1 spends 4 units of total time executing.
Example 2:
Input: n = 1, logs = ["0:start:0","0:start:2","0:end:5","0:start:6","0:end:6","0:end:7"] Output: [8] Explanation: Function 0 starts at the beginning of time 0, executes for 2 units of time, and recursively calls itself. Function 0 (recursive call) starts at the beginning of time 2 and executes for 4 units of time. Function 0 (initial call) resumes execution then immediately calls itself again. Function 0 (2nd recursive call) starts at the beginning of time 6 and executes for 1 unit of time. Function 0 (initial call) resumes execution at the beginning of time 7 and executes for 1 unit of time. So function 0 spends 2 + 4 + 1 + 1 = 8 units of total time executing.
Example 3:
Input: n = 2, logs = ["0:start:0","0:start:2","0:end:5","1:start:6","1:end:6","0:end:7"] Output: [7,1] Explanation: Function 0 starts at the beginning of time 0, executes for 2 units of time, and recursively calls itself. Function 0 (recursive call) starts at the beginning of time 2 and executes for 4 units of time. Function 0 (initial call) resumes execution then immediately calls function 1. Function 1 starts at the beginning of time 6, executes 1 unit of time, and ends at the end of time 6. Function 0 resumes execution at the beginning of time 6 and executes for 2 units of time. So function 0 spends 2 + 4 + 1 = 7 units of total time executing, and function 1 spends 1 unit of total time executing.
Constraints:
1 <= n <= 1001 <= logs.length <= 5000 <= function_id < n0 <= timestamp <= 109- No two start events will happen at the same timestamp.
- No two end events will happen at the same timestamp.
- Each function has an
"end"log for each"start"log.
Accepted
162,679
Submissions
271,753
class Solution:
def exclusiveTime(self, n: int, logs: List[str]) -> List[int]:
stack,out,last_time=[],[0]*n,0
for log in logs:
ind,op,time=log.split(':')
ind,time=int(ind),int(time)
if op=="start":
if stack:
out[stack[-1]]+=time-last_time
stack+=[ind]
else:
out[stack.pop()]+=time-last_time+1
last_time=time+(op=="end")
return out注意指针位置
边栏推荐
- Linux Mysql安装
- 高通9x07两种启动模式
- Interpretation of the most dirty technology in history, I can understand 60 it terms in seconds
- Which one is better for rendering renderings? 2022 latest measured data (IV)
- Map (set) operation in go language
- Third party payment in the second half: scuffle to symbiosis
- Talk about the implementation principle of @autowired
- Spirit matrix for leetcode topic analysis
- Comprehensive analysis of news capture
- List interface three sub implementation classes
猜你喜欢
![Vulnhub | DC: 4 | [combat]](/img/33/b7422bdb18f39e9eb55855dbf1d584.png)
Vulnhub | DC: 4 | [combat]

Monitor the cache update of Eureka client

Observer mode

The rtsp/onvif protocol video platform easynvr startup service reports an error "service not found". How to solve it?

jmeter压测结果分析

数据资产为王,解析企业数字化转型与数据资产管理的关系

Qualcomm 9x07 two startup modes

为什么用生长型神经气体网络(GNG)?

给你的win10装一个wget
![Vulnhub | dc: 3 | [actual combat]](/img/97/e5ba86f2694fe1705c13c60484cff6.png)
Vulnhub | dc: 3 | [actual combat]
随机推荐
Why do we say that the data service API is the standard configuration of the data midrange?
How to migrate x86 architecture applications to arm architecture at low cost
Do not put files with garbled names into the CFS of NFS protocol
How to restore visualizations and dashboards after kibana rebuilds the index
After easynvr video is enabled, no video file is generated. How to solve this problem?
Multi-scale feature combination in target detection
自组织映射神经网络(SOM)
5-旋转的小菊-旋转画布和定时器
3-ProgressBar和二次裁剪
On the light application platform finclip and the mobile application development platform mpaas
Vulnhub | DC: 4 | [combat]
如何评价代码质量
Only 187 bytes of desktop dream code
Introduction to typescript and basic types of variable definitions
谈谈 @Autowired 的实现原理
Paper reading [quovadis, action recognition? A new model and the dynamics dataset]
6、 Web Architecture Design
史上最污技术解读,60 个 IT 术语我居然秒懂了......
Easycvr accesses the website through the domain name. How to solve the problem that the video cannot be viewed back?
高通9x07两种启动模式