递归解决
二叉搜索树的后序遍历序列
http://www.nowcoder.com/questionTerminal/a861533d45854474ac791d90e447bafd
递归解决
# -*- coding:utf-8 -*-
class Solution:
def VerifySquenceOfBST(self, sequence):
if len(sequence)<1:
return False
elif len(sequence) ==1:
return True
else:
index = 0
father = sequence[-1]
for i in range(len(sequence)-1):
if sequence[i] < father and sequence[i+1] >father:
index = i
break
if i+1 == len(sequence)-1:
return True
for temp in sequence[:index+1]:
if temp >father:
return False
for temp in sequence[index+1:-1]:
if temp <father:
return False
return self.VerifySquenceOfBST(sequence[:index+1]) and self.VerifySquenceOfBST(sequence[index+1:])
# write code here
，
查看19道真题和解析
投递阿里巴巴集团等公司10个岗位 >