about summary refs log tree commit diff
path: root/universe/data_structures_and_algorithms/trickling-water.py
diff options
context:
space:
mode:
authorWilliam Carroll <wpcarro@gmail.com>2020-01-29T14·29+0000
committerWilliam Carroll <wpcarro@gmail.com>2020-01-29T14·29+0000
commitfb9380ba268b3cd27372acadb87b14cc96163374 (patch)
treef65d7fc8d8726499165a0949af39afd1abc8118c /universe/data_structures_and_algorithms/trickling-water.py
parent15110e6de9f85537c7847267caa35fa068aea001 (diff)
parent8ad51b24dd8719840aac47134835ea25cfe1b0b8 (diff)
Add 'universe/' from commit '8ad51b24dd8719840aac47134835ea25cfe1b0b8'
git-subtree-dir: universe
git-subtree-mainline: 15110e6de9f85537c7847267caa35fa068aea001
git-subtree-split: 8ad51b24dd8719840aac47134835ea25cfe1b0b8
Diffstat (limited to 'universe/data_structures_and_algorithms/trickling-water.py')
-rw-r--r--universe/data_structures_and_algorithms/trickling-water.py38
1 files changed, 38 insertions, 0 deletions
diff --git a/universe/data_structures_and_algorithms/trickling-water.py b/universe/data_structures_and_algorithms/trickling-water.py
new file mode 100644
index 000000000000..45621990ecf9
--- /dev/null
+++ b/universe/data_structures_and_algorithms/trickling-water.py
@@ -0,0 +1,38 @@
+class Node(object):
+    def __init__(self, value, children=[]):
+        self.value = value
+        self.children = children
+
+
+################################################################################
+# Solution
+################################################################################
+def trip_time(node):
+    s = []
+    result = 0
+    s.append((node.value, node))
+    while s:
+        p, node = s.pop()
+        if not node.children:
+            result = max(result, p)
+        for x in node.children:
+            s.append((p + x.value, x))
+    return result
+
+
+################################################################################
+# Tests
+################################################################################
+tree = Node(
+    0,
+    children=[
+        Node(5, children=[Node(6)]),
+        Node(2, children=[
+            Node(6),
+            Node(10),
+        ]),
+        Node(3, children=[Node(2, children=[Node(11)])]),
+    ])
+
+assert trip_time(tree) == 16
+print("Tests pass!")