forked from DaleStudy/leetcode-study
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathEgonD3V.py
More file actions
57 lines (43 loc) ยท 1.63 KB
/
EgonD3V.py
File metadata and controls
57 lines (43 loc) ยท 1.63 KB
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
from typing import Optional
from unittest import TestCase, main
# Definition for a binary tree node.
class TreeNode:
def __init__(self, val=0, left=None, right=None):
self.val = val
self.left = left
self.right = right
class Solution:
def isSameTree(self, p: Optional[TreeNode], q: Optional[TreeNode]) -> bool:
return self.solve_dfs(p, q)
"""
Runtime: 0 ms (Beats 100.00%)
Time Complexity: O(min(p, q))
> dfs๋ฅผ ํตํด ๋ชจ๋ node๋ฅผ ๋ฐฉ๋ฌธํ๋ฏ๋ก, ๊ฐ ํธ๋ฆฌ์ node์ ๊ฐฏ์๋ฅผ ๊ฐ๊ฐ p, q๋ผ ํ๋ฉด, O(min(p, q))
Memory: 16.62 MB (Beats 15.78%)
Space Complexity: O(min(p, q))
> ์ผ๋ฐ์ ์ธ ๊ฒฝ์ฐ ํธ๋ฆฌ์ ๊น์ด๋งํผ dfs ํธ์ถ ์คํ์ด ์์ด๋, ์ต์
์ ๊ฒฝ์ฐ ํ์ชฝ์ผ๋ก ํธํฅ๋์๋ค๋ฉด O(min(p, q)), upper bound
"""
def solve_dfs(self, p: Optional[TreeNode], q: Optional[TreeNode]) -> bool:
def dfs(p: Optional[TreeNode], q: Optional[TreeNode]) -> bool:
if p is None and q is None:
return True
elif (p is not None and q is not None) and (p.val == q.val):
return dfs(p.left, q.left) and dfs(p.right, q.right)
else:
return False
return dfs(p, q)
class _LeetCodeTestCases(TestCase):
def test_1(self):
p_1 = TreeNode(1)
p_2 = TreeNode(2)
p_3 = TreeNode(3)
p_1.left = p_2
p_1.right = p_3
q_1 = TreeNode(1)
q_2 = TreeNode(3)
q_3 = TreeNode(3)
q_1.left = q_2
q_1.right = q_3
self.assertEqual(Solution().isSameTree(p_1, q_1), True)
if __name__ == '__main__':
main()