LeetCode 109. Convert Sorted List to Binary Search Tree

Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.

For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never differ by more than 1.

Example:

Given the sorted linked list: [-10,-3,0,5,9],
One possible answer is: [0,-3,9,-10,null,5], which represents the following height balanced BST:

      0
     / \
   -3   9
   /   /
 -10  5

给定一个有序序列，构造一个平衡二叉树，搜索了平衡二叉树的定义，加上之前做过一些二叉树的题，这题思路来的比较快

对每一个节点找到当前子树的根节点即可，递归调用。
只是在写程序的时候还是粗心浪费了很多时间找错

public TreeNode sortedListToBST(ListNode head) {


        ListNode endNode = head;
        while (endNode != null) {
            endNode = endNode.next;
        }
        TreeNode headNode = sortedListToBST(head, endNode);

        return headNode;
    }
    public TreeNode sortedListToBST(ListNode head,ListNode end){
        if (head == end) {
            return null;
        }

        ListNode slow = head;
        ListNode fast = head;
        while (fast != end && fast.next != end) {
            slow = slow.next;
            fast = fast.next.next;
        }

        TreeNode nowNode = new TreeNode(slow.val);
        nowNode.left = sortedListToBST(head, slow);
        nowNode.right = sortedListToBST(slow.next, end);

        return nowNode;
    }