aboutsummaryrefslogtreecommitdiff
path: root/leetcode.py
blob: 29f7144accd25f712c682b84f67836038c184f7d (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
from collections import deque


class TreeNode:
    def __init__(self, val=0, left=None, right=None):
        self.val = val
        self.left = left
        self.right = right


def treenode_build(vals):
    if not vals:
        return None
    root = TreeNode(vals[0])
    q, i = deque([root]), 1
    while q and i < len(vals):
        curr = q.popleft()
        if vals[i] is not None:
            curr.left = TreeNode(vals[i])
            q.append(curr.left)
        i += 1
        if i < len(vals) and vals[i] is not None:
            curr.right = TreeNode(vals[i])
            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