当前位置:网站首页>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注意指针位置
边栏推荐
- 6-闪耀的激光-CALayer 的应用
- MySQL common skills
- usb peripheral 驱动 - configfs
- jmeter压测结果分析
- 鸿蒙读取资源文件
- Integers and operators in go data types (3)
- Open source technology exchange batch stream integrated data synchronization engine Chunjun data restore DDL function module analysis
- [cloud computing] GFS ideological advantages and architecture
- Map (set) operation in go language
- Why use growth neural gas network (GNG)?
猜你喜欢
随机推荐
Open source stealing malware mercurial found in the field for "educational purposes"
jmeter压测结果分析
After easynvr video is enabled, no video file is generated. How to solve this problem?
Multi Chain and cross chain are the future
Go 数据类型篇(二)之Go 支持的数据类型概述及布尔类型
Leetcode topic analysis sort colors
训练后的随机森林模型导出和加载
ArcLayoutView: 一个弧形布局的实现
2- use line segments to form graphics and coordinate conversion
5-rotating Daisy - rotating canvas and timer
Implementing an open source app store with swiftui
How to sort a dictionary by value or key?
1-渐变、阴影和文本
Vulnhub | DC: 4 | [combat]
How can I handle the "unable to load" exception when easyplayer plays webrtcs?
What is a dedicated server line
6、 Web Architecture Design
点云库pcl从入门到精通 第十章
为什么用生长型神经气体网络(GNG)?
Lighthouse cloud desktop experience


![Vulnhub | DC: 4 | [combat]](/img/33/b7422bdb18f39e9eb55855dbf1d584.png)






