【刷题】LC-109：有序链表转换二叉搜索树

最新推荐文章于 2024-05-10 14:45:15 发布

叹了口丶气

最新推荐文章于 2024-05-10 14:45:15 发布

阅读量129

点赞数

分类专栏： LeetCode 文章标签：链表数据结构

本文链接：https://blog.csdn.net/yexiguafu/article/details/126553888

版权

LeetCode 专栏收录该内容

68 篇文章 1 订阅

订阅专栏

思路：还是递归的的方式

class Solution {
    public TreeNode sortedListToBST(ListNode head) {
        return buildTree(head, null);
    }

    public TreeNode buildTree(ListNode left, ListNode right) {
        if (left == right) {
            return null;
        }
        ListNode mid = getMedian(left, right);
        TreeNode root = new TreeNode(mid.val);
        root.left = buildTree(left, mid);
        root.right = buildTree(mid.next, right);
        return root;
    }

    public ListNode getMedian(ListNode left, ListNode right) {
        ListNode fast = left;
        ListNode slow = left;
        while (fast != right && fast.next != right) {
            fast = fast.next;
            fast = fast.next;
            slow = slow.next;
        }
        return slow;
    }
}