2022.8.7-----leetcode.636

 public int[] exclusiveTime(int n, List logs) {int[] ans=new int[n];Deque s=new ArrayDeque<>();//Simulate the current callDeque s1=new ArrayDeque<>();//Store the start and end points of the ended function, including functions at the same level and internal functionsfor(String log:logs){String[] ss=log.split(":");if(ss[1].equals("start")){//The call start point is pushed into the stacks.add(new int[]{Integer.parseInt(ss[0]),Integer.parseInt(ss[2])});}else{int[] tmp=s.pollLast();int time=Integer.parseInt(ss[2])-tmp[1]+1;//The calling interval of the current end functionwhile(!s1.isEmpty()&&s1.getLast()[0]>=tmp[1]){int[] tmp1=s1.pollLast();time-=tmp1[1]-tmp1[0]+1;//Determine whether the ended function is inside the current end function}ans[tmp[0]]+=time;//accumulate times1.add(new int[]{tmp[1],Integer.parseInt(ss[2])});//Add the current end function to the stack}}return ans;}