import java.util.*;
/*
* public class TreeNode {
* int val = 0;
* TreeNode left = null;
* TreeNode right = null;
* public TreeNode(int val) {
* this.val = val;
* }
* }
*/
public class Solution {
/**
* 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可
*
*
* @param root TreeNode类
* @return bool布尔型
*/
public int pre=Integer.MIN_VALUE;
public boolean isValidBST (TreeNode root) {
// write code here
if(root==null){return true;}
if(!isValidBST(root.left)){
return false;
}
if(root.val<pre){return false;}
pre=root.val;
return isValidBST(root.right);
}
}
continue是跳过本次循环直接开始下一次循环的
在这里插入代码片
import java.util.*;
/*
* public class TreeNode {
* int val = 0;
* TreeNode left = null;
* TreeNode right = null;
* public TreeNode(int val) {
* this.val = val;
* }
* }
*/
public class Solution {
/**
* 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可
*
*
* @param root TreeNode类
* @return bool布尔型
*/
public boolean isCompleteTree (TreeNode root) {
// write code here''
if(root==null){
return true;
}
Queue<TreeNode> queue=new LinkedList<>();
queue.offer(root);
TreeNode cur;
Boolean notComplete=false;
while(!queue.isEmpty()){
cur=queue.poll();
if(cur==null){
notComplete=true;
continue;
}
if(notComplete==true){
return false;
}
queue.offer(cur.left);
queue.offer(cur.right);
}return true;
}
}
看了笔记