摘要: 1、530.二叉搜索树的最小绝对差 class Solution { private int res = Integer.MAX_VALUE; private TreeNode pre; public void traversal(TreeNode node) { if(node == null) 阅读全文
posted @ 2023-02-04 21:29 黄三七 阅读(32) 评论(0) 推荐(0)