代码笔记

最新推荐文章于 2024-11-12 23:07:13 发布

weixin_30216561

最新推荐文章于 2024-11-12 23:07:13 发布

阅读量79

点赞数

文章标签：数据结构与算法

原文链接：http://www.cnblogs.com/Simeonwu/p/9888880.html

版权

2018-09-13 10:48
public class Solution {
    public boolean isValidBST(TreeNode root) {
        return valid(root, Long.MIN_VALUE, Long.MAX_VALUE);
    }
    public boolean valid(TreeNode root, long low, long high) {
        if (root == null)
            return true;
        if (root.val <= low || root.val >= high)
            return false;
        return valid(root.left, low, root.val) && valid(root.right, root.val, high);
    }

}

List<Map.Entry<String, String>> list = new ArrayList<>(map.entrySet());
Collections.sort(list, Comparator.comparing(Map.Entry::getValue));
反转排序
 list.sort(Comparator.comparing(Map.Entry<Long,String>::getValue).reversed());  或者
 list.sort(Collections.reverseOrder(Comparator.comparing(Map.Entry::getValue)));

public ListNode reverseList(ListNode head) {
    ListNode pre = null;
    ListNode next = null;
    while (head != null) {
        next = head.next;
        head.next = pre;
        pre = head;
        head = next;
    }
    return pre;
}