-
Notifications
You must be signed in to change notification settings - Fork 2
/
ExclusiveTimeOfFunctions.java
67 lines (58 loc) · 2.67 KB
/
ExclusiveTimeOfFunctions.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
package Leetcode;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Deque;
import java.util.List;
/**
* @author kalpak
*
* 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.
*/
public class ExclusiveTimeOfFunctions {
public static int[] exclusiveTime(int n, List<String> logs) {
int[] result = new int[n];
Deque<int[]> stack = new ArrayDeque<>();
for(String log : logs) {
String temp[] = log.split(":");
int pid = Integer.parseInt(temp[0]);
int time = Integer.parseInt(temp[2]);
if(temp[1].equals("start")) {
stack.push(new int []{pid, time});
} else {
int executionTime = time - stack.pop()[1] + 1;
result[pid] += executionTime;
if(!stack.isEmpty()) {
result[stack.peek()[0]] -= executionTime; // penalizing the previous process that got hold because of the current process
}
}
}
return result;
}
public static void main(String[] args) {
int n = 2;
List<String> logs = new ArrayList<>();
logs.add("0:start:0");
logs.add("1:start:2");
logs.add("1:end:5");
logs.add("0:end:6");
int[] result = exclusiveTime(n, logs);
for(int i : result)
System.out.print(i + " ");
System.out.println();
}
}