LeetCode636. Exclusive Time of Functions

One-pass solution.

During iterating through the input logs, there are 4 possible conditions:

Previous log is “start”, current log is “start”. This means that either the previous function is calling some other function or it’s calling itself recursively. However, it makes no difference for those 2 cases, we just add the time gap between these 2 start to the total exclusive time of previous function.
Previous log is “start”, current log is “end”. This means that current function runs to an end and haven’t call any other functions including itself. In this case we simply add this time gap to the total exclusive time of current function. Note this have a different calcuiating method, which is endTime - startTime + 1.
Previous log is “end”, current log is “start”. This means that a previous function call is completed and the original function is running and is calling another function. Thus this time gap should be added to the original outer function that performs the call. However, there is another case for this as well. If there is no function performs the call, that means during this time gap the CPU is idle, and we should just ignore this time gap.
Previous log is “end”, current log is “end”. This means that a previous function call is end, and the function that performs the call is completed as well. Thus this time gap should be added to the outer function that performs the call.

Summarize them up, we get the following solution.

This algorithm runs in O(n)time, O(n) space worst case for length-n input.

class Solution {public int[] exclusiveTime(int n, List<String> logs) {int[] ret = new int[n];Deque<Integer> deque = new ArrayDeque<>();String[] log = logs.get(0).split(":");deque.push(Integer.parseInt(log[0]));int prevTime = Integer.parseInt(log[2]);for (int i = 0; i < logs.size(); i++) {log = logs.get(i).split(":");int time = Integer.parseInt(log[2]);if (log[1].equals("start")) {if (!deque.isEmpty()) {ret[deque.peek()] += (time - prevTime);}prevTime = time;deque.push(Integer.parseInt(log[0]));} else { // "end"ret[deque.pop()] += (time - prevTime + 1);prevTime = time + 1;}}return ret;}
}

LeetCode636. Exclusive Time of Functions相关推荐

LeetCode 636 Exclusive Time of Functions
LeetCode 636 Exclusive Time of Functions Problem Description: 记录每一函数运行时间,其中需要注意到当前函数start开始时,上一个函数可能 ...
leetcode 636. Exclusive Time of Functions | 636. 函数的独占时间（Stack）
题目 https://leetcode.com/problems/exclusive-time-of-functions/ 题解类似于括号匹配问题,遍历 list,每一次来到新元素时,结算当前正在执 ...
leetcode刷题规划
LeetCode精华题目列表[刷题规划系列] – TuringPlanet 目录算法题到底在考察什么? 题目列表 Array String Linked List Queue Stack Advan ...
LeetCode 力扣算法题解汇总，All in One
作者: 负雪明烛 id: fuxuemingzhu 个人博客: https://fuxuemingzhu.cn 关键词:LeetCode,力扣,算法,题解,汇总,解析把自己刷过的所有题目做一个整理, ...
LeetCode All in One 题目讲解汇总(持续更新中...)
原文地址:https://www.cnblogs.com/grandyang/p/4606334.html 终于将LeetCode的大部分题刷完了,真是漫长的第一遍啊,估计很多题都忘的差不多了,这次开 ...
LinkedIn TAG
1 [leetcode]243. Shortest Word Distance最短单词距离 Two Pointers 2 [leetcode]244. Shortest Word Distance I ...
[译]5.11. Functions and Variables Featured in This Chapter 本章的函数，变量和特性
目录:http://www.cnblogs.com/WuCountry/archive/2008/11/15/1333960.html [不提供插图,读者最好从网上下载源书] 5.11. Func ...
UE3 Light Functions (光照函数)
Light Functions (光照函数) Light Functions (光照函数) 概述 Decals(贴花) vs 光照函数可以使用哪些材质表达式? Texture 2D(二维贴图) Te ...
读《Evolving Algebraic Constructions for Designing Bent Boolean Functions》
Picek, S., Jakobovic, D.: Evolving algebraic constructions for designing bent Boolean functions. In: ...

LeetCode636. Exclusive Time of Functions

LeetCode636. Exclusive Time of Functions相关推荐

最新文章

热门文章