摘要: 1、669 修剪二叉搜索树 class Solution { public TreeNode trimBST(TreeNode root, int low, int high) { if(root == null){ return null; } if(root.val < low){ return 阅读全文
posted @ 2023-02-06 23:24 黄三七 阅读(19) 评论(0) 推荐(0)