Middle-题目117:98. Validate Binary Search Tree
来源:互联网 发布:上海财经大学 网络教育 编辑:程序博客网 时间:2024/05/29 15:56
题目原文:
Given a binary tree, determine if it is a valid binary search tree (BST).
题目大意:
给出一个二叉树,判断是不是合法的二叉搜索树。
题目分析:
看中序遍历是否递增。
源码:(language:java)
public class Solution { public boolean isValidBST(TreeNode root) { List<Integer> list = new ArrayList<Integer>(); inOrderVisit(list,root); return isSortedList(list); } private void inOrderVisit(List<Integer> list, TreeNode node) { if(node!=null) { inOrderVisit(list, node.left); list.add(node.val); inOrderVisit(list, node.right); } } private boolean isSortedList(List<Integer> list) { if(list.size()<2) return true; else { for(int i = 0;i<list.size()-1;i++) { if(list.get(i)>=list.get(i+1)) return false; } return true; } }}
成绩:
4ms,beats 12.79%,众数1ms,72.10%
0 0
- Middle-题目117:98. Validate Binary Search Tree
- LeetCode算法题目:Validate Binary Search Tree
- 98. Validate Binary Search Tree
- 98. Validate Binary Search Tree
- 98. Validate Binary Search Tree
- 98. Validate Binary Search Tree
- 98. Validate Binary Search Tree
- 98. Validate Binary Search Tree
- 98. Validate Binary Search Tree
- 98. Validate Binary Search Tree
- 98. Validate Binary Search Tree
- 98. Validate Binary Search Tree
- 98. Validate Binary Search Tree
- 98. Validate Binary Search Tree
- 98. Validate Binary Search Tree
- 98. Validate Binary Search Tree
- 98. Validate Binary Search Tree
- 98. Validate Binary Search Tree
- #码神学习#第三天
- LintCode(100)删除排序数组中的重复数字
- Middle-题目116:224. Basic Calculator
- 变量应用
- java继承关系
- Middle-题目117:98. Validate Binary Search Tree
- 重载与重写的区别
- SQL常用易忘命令
- 信息检索(IR)的评价指标介绍 - 准确率、召回率、F1、mAP、ROC、AUC
- 背包问题
- 用java写的冒泡排序算法
- ZeroICE 3.5.1绑定地址错误
- xshell项目服务器命令
- 非二进制字符串数据:CHAR,VARCHAR,TEXT