剑指 Offer 33. 二叉搜索树的后序遍历序列
难度中等159
输入一个整数数组,判断该数组是不是某二叉搜索树的后序遍历结果。如果是则返回 true
,否则返回 false
。假设输入的数组的任意两个数字都互不相同。
参考以下这颗二叉搜索树:
5
/ \
2 6
/ \
1 3
示例 1:
输入: [1,6,3,2,5]
输出: false
示例 2:
输入: [1,3,2,6,5]
输出: true
提示:
数组长度 <= 1000
Note
- 想到dfs,但没想到具体的判法
- 看了剑指offer的样例,有了思路, return true的条件为: len 《= 1 或者 已经局部有序, 结果TLE
- 找根
- 找极限的左子树
- 判断右子树均大于根
Code
class Solution:
def verifyPostorder(self, postorder: List[int]) -> bool:
return self.dfs(postorder)
def dfs(self, postorder: List[int]) -> bool:
l = len(postorder)
if (l <= 1): return True
root = postorder[-1]
left = root
cnt = 0
for i in postorder:
if i > root:
left = cnt
break
cnt += 1
if cnt == l and postorder == sorted(postorder) : return True
for j in postorder[left+1:]:
if(j < root):
return False
return self.dfs(postorder[:cnt]) and self.dfs(postorder[cnt:l - 1])
Review
-
for j in postorder[left+1:]:, left不是下表,而是里面的内容
-
return self.dfs(postorder[:cnt]) and self.dfs(postorder[cnt:l - 1]) 应该是到[:cnt-1], 数组下表是包含的,range(a,b)是不含b的
-
AC代码:
class Solution: def verifyPostorder(self, postorder: List[int]) -> bool: return self.dfs(postorder) def dfs(self, postorder: List[int]) -> bool: l = len(postorder) if (l <= 1): return True root = postorder[-1] left = root cnt = 0 for i in postorder: if i > root: left = cnt break cnt += 1 #if cnt == l and postorder == sorted(postorder) : return True for j in postorder[cnt :]: if(j < root): return False return self.dfs(postorder[:cnt-1]) and self.dfs(postorder[cnt:l - 1])
Note2
借助单调栈,把postorder逆序,变成前序的镜像
步骤:
Code2
class Solution:
def verifyPostorder(self, postorder: [int]) -> bool:
stack, root = [], float("+inf")
for i in range(len(postorder) - 1, -1, -1):
if postorder[i] > root: return False
while(stack and postorder[i] < stack[-1]):
root = stack.pop()
stack.append(postorder[i])
return True