File size: 2,306 Bytes
01a492e | 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 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 |
from __future__ import annotations
import collections
import functools
import math
import random
import string
from bisect import *
from collections import *
from functools import *
from heapq import *
from itertools import *
from math import *
from operator import *
from string import *
from typing import *
class ListNode:
def __init__(self, val=0, next=None):
self.val = val
self.next = next
class TreeNode:
def __init__(self, val=0, left=None, right=None):
self.val = val
self.left = left
self.right = right
class Node:
def __init__(self, val=0, children=None, next=None, random=None):
self.val = val
self.children = children
self.next = next
self.random = random
def list_node(values):
if not values:
return None
dummy = ListNode()
current = dummy
for value in values:
current.next = ListNode(value)
current = current.next
return dummy.next
def list_values(node):
values = []
steps = 0
while node is not None:
values.append(node.val)
node = node.next
steps += 1
if steps > 10000:
raise AssertionError("linked list appears to contain a cycle")
return values
def is_same_list(left, right):
return list_values(left) == list_values(right)
def tree_node(values):
if not values:
return None
nodes = [None if value is None else TreeNode(value) for value in values]
children = nodes[::-1]
root = children.pop()
for node in nodes:
if node is None:
continue
if children:
node.left = children.pop()
if children:
node.right = children.pop()
return root
def tree_values(root):
if root is None:
return []
values = []
queue = deque([root])
while queue:
node = queue.popleft()
if node is None:
values.append(None)
continue
values.append(node.val)
queue.append(node.left)
queue.append(node.right)
while values and values[-1] is None:
values.pop()
return values
def is_same_tree(left, right):
return tree_values(left) == tree_values(right)
class Solution:
def addBinary(self, a: str, b: str) -> str:
|