Given the running logs ofnfunctions that are executed in a nonpreemptive single threaded CPU, find the exclusive time of these functions.

Each function has a unique id, start from0ton-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 = 2
logs = 
["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:

1. Input logs will be sorted by timestamp, NOT log id.
2. Your output should be sorted by function id, which means the 0th element of your output corresponds to the exclusive time of function 0.
3. Two functions won't start or end at the same time.
4. Functions could be called recursively, and will always end.
5. 1 < = n < = 100

class Solution {
    public int[] exclusiveTime(int n, List<String> logs) {
        if (logs == null || logs.size() == 0) return new int[0];
        int[] ans = new int[n];
        Stack<Integer> stack = new Stack<>();
        String[] temp = logs.get(0).split(":");
        int prev = Integer.parseInt(temp[2]);
        stack.push(Integer.parseInt(temp[0]));

        int index = 1;
        while (index < logs.size()){
            temp =  logs.get(index).split(":");

            if (temp[1].equals("start")){
                if (!stack.isEmpty())
                    ans[stack.peek()] += Integer.parseInt(temp[2]) - prev;
                stack.push(Integer.parseInt(temp[0]));
                prev = Integer.parseInt(temp[2]);
            }
            else if (temp[1].equals("end")){
                ans[stack.peek()] += Integer.parseInt(temp[2]) - prev + 1;
                stack.pop();
                prev = Integer.parseInt(temp[2]) + 1;
            }

            index++;
        }

        return ans;
    }
}