Skip to content

Latest commit

 

History

History
3 lines (3 loc) · 142 Bytes

File metadata and controls

3 lines (3 loc) · 142 Bytes

解法要点

  1. BST(binary search trees)是左叶值小于节点值,右叶值大于节点值
  2. 运用DP解法,迭代处理各种情况