forked from DaleStudy/leetcode-study
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathwozlsla.py
More file actions
49 lines (38 loc) ยท 1.16 KB
/
wozlsla.py
File metadata and controls
49 lines (38 loc) ยท 1.16 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
from typing import Optional
"""
# Intuition
์ด๋ป๊ฒ ์์๊ฐ ์ ์๋์ง?
์ํ -> ์ด๋ค ๊ตฌ์กฐ?
๋น๊ต
# Approach
ํธ๋ฆฌ๊ฐ ๋์ผํ๋ ค๋ฉด ?
1. ๊ตฌ์กฐ ๋น๊ต
2. ๊ฐ ๋น๊ต
ํธ๋ฆฌ ๋์ ํ์
- ๋ ๋
ธ๋๊ฐ ๋ชจ๋ null (๊ตฌ์กฐ) -> True
- ๋ ์ค ํ๋๋ง null (๊ตฌ์กฐ) -> False
- ๋ ๋
ธ๋๊ฐ ๋ชจ๋ ๊ฐ์ด ์์ (๊ฐ) -> True/False
# Complexity
์๊ฐ ๋ณต์ก๋
- O(N)
๊ณต๊ฐ ๋ณต์ก๋
- (์ฌ๊ท) ์ ์ ์ํ: ์ฝ ์คํ -> O(H)
"""
# 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:
# ์ข
๊ฒฐ ์กฐ๊ฑด 1: ๋ ๋
ธ๋๊ฐ ๋ชจ๋ null์ด๋ฉด ๊ตฌ์กฐ๊ฐ ๋์ผํจ
if p is None and q is None:
return True
# ์ข
๋ฃ ์กฐ๊ฑด 2:
# - ๊ตฌ์กฐ ๋ถ์ผ์น
# - ๊ฐ ๋ถ์ผ์น
if p is None or q is None or p.val != q.val:
return False
# (์ฌ๊ท) ์์ ๋น๊ต
return self.isSameTree(p.left, q.left) and self.isSameTree(p.right, q.right)