diff options
author | Jack Sangdahl <[email protected]> | 2025-08-25 13:06:21 -0600 |
---|---|---|
committer | Jack Sangdahl <[email protected]> | 2025-08-25 13:06:21 -0600 |
commit | 3f521a9849997608712e92ad8e90e83ff1cefdc0 (patch) | |
tree | 7b8224a755318088a78d30c7bb2ddfa9e2473bae /leetcode.py | |
parent | 07c9e6547189b072d990fb861194449cdc14f5c5 (diff) | |
download | leetcode-3f521a9849997608712e92ad8e90e83ff1cefdc0.tar.gz leetcode-3f521a9849997608712e92ad8e90e83ff1cefdc0.zip |
chore: Tidy util files and add listnode_build
Removes unnecessary C++ specific header file code
Adds C and Python helper functions to build a full ListNode based on an
integer array as input
Diffstat (limited to 'leetcode.py')
-rw-r--r-- | leetcode.py | 19 |
1 files changed, 18 insertions, 1 deletions
diff --git a/leetcode.py b/leetcode.py index 6fdbe28..29f7144 100644 --- a/leetcode.py +++ b/leetcode.py @@ -9,7 +9,7 @@ class TreeNode: def treenode_build(vals): - if not vals or vals[0] is None: + if not vals: return None root = TreeNode(vals[0]) q, i = deque([root]), 1 @@ -24,3 +24,20 @@ def treenode_build(vals): q.append(curr.right) i += 1 return root + + +class ListNode: + def __init__(self, val=0, next=None): + self.val = val + self.next = next + + +def listnode_build(vals): + if not vals or vals[0] is None: + return None + head = ListNode(vals[0]) + curr = head + for i in vals[1:]: + curr.next = ListNode(i) + curr = curr.next + return head |