Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly
Sign up
Appearance settings

Commit 25a6fe5

Browse files
author
hj.tian
committed
feat: add leetcode75 day30
feat: add leetcode75 day30
1 parent ddfc8e5 commit 25a6fe5

File tree

3 files changed

+114
-0
lines changed

3 files changed

+114
-0
lines changed

‎leetcode75/day30_100.py

Lines changed: 27 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,27 @@
1+
from typing import Optional
2+
3+
from helper import TreeNode, create_binary_tree
4+
5+
6+
class Solution:
7+
def isSameTree(self, p: Optional[TreeNode], q: Optional[TreeNode]) -> bool:
8+
if p is None and q is None:
9+
return True
10+
elif p and q and p.val == q.val:
11+
return self.isSameTree(p.left, q.left) and self.isSameTree(p.right, q.right)
12+
else:
13+
return False
14+
15+
16+
if __name__ == "__main__":
17+
p = create_binary_tree(nums=[1, 2, 3], index=0)
18+
q = create_binary_tree(nums=[1, 2, 3], index=0)
19+
assert Solution().isSameTree(p, q) is True
20+
21+
p = create_binary_tree(nums=[1, 2, None], index=0)
22+
q = create_binary_tree(nums=[1, None, 2], index=0)
23+
assert Solution().isSameTree(p, q) is False
24+
25+
p = create_binary_tree(nums=[1, 2, 1], index=0)
26+
q = create_binary_tree(nums=[1, 1, 2], index=0)
27+
assert Solution().isSameTree(p, q) is False

‎leetcode75/day30_101.py

Lines changed: 39 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,39 @@
1+
from typing import List, Optional
2+
3+
from helper import TreeNode, create_binary_tree
4+
5+
6+
class Solution:
7+
def isSymmetric(self, root: Optional[TreeNode]) -> bool:
8+
if root is None:
9+
return True
10+
queue: List[Optional[TreeNode]] = [root]
11+
while queue:
12+
size = len(queue)
13+
nums: List[Optional[int]] = []
14+
for i in range(size):
15+
node = queue[i]
16+
if node:
17+
queue.append(node.left)
18+
queue.append(node.right)
19+
nums.append(node.left.val if node.left else None)
20+
nums.append(node.right.val if node.right else None)
21+
start, end = 0, len(nums) - 1
22+
while start < end:
23+
if nums[start] != nums[end]:
24+
return False
25+
start += 1
26+
end -= 1
27+
queue = queue[size:]
28+
return True
29+
30+
31+
if __name__ == "__main__":
32+
root = create_binary_tree(nums=[1, 2, 2, 3, 4, 4, 3], index=0)
33+
assert Solution().isSymmetric(root) is True
34+
35+
root = create_binary_tree(nums=[1, 2, 2, None, 3, None, 3], index=0)
36+
assert Solution().isSymmetric(root) is False
37+
38+
root = create_binary_tree(nums=[2, 3, 3, 4, 5, 5, 4, None, None, 8, 9, None, None, 9, 8], index=0)
39+
assert Solution().isSymmetric(root) is False

‎leetcode75/day30_199.py

Lines changed: 48 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,48 @@
1+
from typing import List, Optional
2+
3+
from helper import TreeNode, create_binary_tree
4+
5+
6+
class Solution:
7+
def rightSideView(self, root: Optional[TreeNode]) -> List[int]:
8+
if root is None:
9+
return []
10+
queue: List[Optional[TreeNode]] = [root]
11+
ans: List[int] = [root.val]
12+
while queue:
13+
size = len(queue)
14+
nums: List[Optional[int]] = []
15+
for i in range(size):
16+
node = queue[i]
17+
if node:
18+
queue.append(node.left)
19+
queue.append(node.right)
20+
nums.append(node.left.val if node.left else None)
21+
nums.append(node.right.val if node.right else None)
22+
valid_num = None
23+
# 特别注意 None 与 0 的严格区别
24+
for num in nums[::-1]:
25+
if num is not None:
26+
valid_num = num
27+
break
28+
if valid_num is not None:
29+
ans.append(valid_num)
30+
queue = queue[size:]
31+
return ans
32+
33+
34+
if __name__ == "__main__":
35+
root = create_binary_tree(nums=[1, 2, 3, None, 5, None, 4], index=0)
36+
assert Solution().rightSideView(root) == [1, 3, 4]
37+
38+
root = create_binary_tree(nums=[1, None, 3], index=0)
39+
assert Solution().rightSideView(root) == [1, 3]
40+
41+
root = create_binary_tree(nums=[], index=0)
42+
assert Solution().rightSideView(root) == []
43+
44+
root = create_binary_tree(nums=[1, 2, 3, None, 5, None, 4, None, None, 10, None, None, None, None, None], index=0)
45+
assert Solution().rightSideView(root) == [1, 3, 4, 10]
46+
47+
root = create_binary_tree(nums=[1, 2, 0], index=0)
48+
assert Solution().rightSideView(root) == [1, 0]

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /