CPMagical CP Library

Problem solution · Python

Finish Time of Tasks I

Finish Time of Tasks I: a Python solution using depth-first search. Learn the idea, check the complexity, and read the full code, with credit to Kamyu LeetCode Solutions.

Technique
Depth-first search
Source
Kamyu LeetCode Solutions
Length
60 lines
Start with the idea.

Try the problem first. If you get stuck, read the approach below, then write your own solution. The full code is at the bottom.

Approach

Depth-first search

For Finish Time of Tasks I, the implementation follows one branch at a time, making it suitable for components, trees, backtracking, or dependency exploration.

  1. Define the state carried into one recursive or stack frame.
  2. Mark or choose the current state before exploring children.
  3. Combine child results or undo the choice when the branch finishes.

Code notes

  • 60 lines of Python from the credited upstream file finish-time-of-tasks-i.py.
  • The implementation visibly relies on sequence storage, cached states.
  • No explicit loop blocks detected, together with recursive traversal.

Complexity

Count unique states for graph traversal; for backtracking, count the branching factor and maximum depth.

Check the problem constraints before deciding whether this complexity will pass.

Source

Code and credit

This code comes from Kamyu LeetCode Solutions by kamyu104 and is used under the MIT licence.

Open problem ↗Original source ↗
Full codeFinish Time of Tasks I · PythonPython
Use this to learn the idea, then write your own version.
# Time:  O(n)# Space: O(n) # iterative dfs, tree dpclass Solution(object):    def finishTime(self, n, edges, baseTime):        """        :type n: int        :type edges: List[List[int]]        :type baseTime: List[int]        :rtype: int        """        POS_INF, NEG_INF = float("inf"), float("-inf")        def iter_dfs():            dp = [0]*n            stk = [(1, 0)]            while stk:                step, u = stk.pop()                if step == 1:                    stk.append((2, u))                    for v in reversed(adj[u]):                        stk.append((1, v))                elif step == 2:                    mx, mn = NEG_INF, POS_INF                    for v in adj[u]:                        mx, mn = max(mx, dp[v]), min(mn, dp[v])                    dp[u] = ((2*mx-mn) if mx is not NEG_INF else 0)+baseTime[u]            return dp[0]            adj = [[] for _ in xrange(n)]        for u, v in edges:            adj[u].append(v)        return iter_dfs()     # Time:  O(n)# Space: O(n)# dfs, tree dpclass Solution2(object):    def finishTime(self, n, edges, baseTime):        """        :type n: int        :type edges: List[List[int]]        :type baseTime: List[int]        :rtype: int        """        POS_INF, NEG_INF = float("inf"), float("-inf")        def dfs(u):            mx, mn = NEG_INF, POS_INF            for v in adj[u]:                ret = dfs(v)                mx, mn = max(mx, ret), min(mn, ret)            return ((2*mx-mn) if mx is not NEG_INF else 0)+baseTime[u]            adj = [[] for _ in xrange(n)]        for u, v in edges:            adj[u].append(v)        return dfs(0)

Keep practising

Did this explanation save you time? I'm a Grade 11 student building this free library to make difficult algorithms easier to understand.

Buy me a coffee ↗