将有序链表转换为BST

为什么80%的码农都做不了架构师？>>>   

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.

解决：

① 使用快慢指针找到中间节点作为根节点，中间节点左右两边就是左右子树，递归构造左右子树即可。

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution { //2ms
    public TreeNode sortedListToBST(ListNode head) {
        if(head == null) return null;
        if(head.next == null) return new TreeNode(head.val);
        ListNode slow = head;
        ListNode fast = head;
        ListNode pre = slow;
        while(fast.next != null && fast.next.next != null){
            pre = slow;
            slow = slow.next;
            fast = fast.next.next;
        }
        fast = slow.next;
        pre.next = null;
        TreeNode cur = new TreeNode(slow.val);
        if(head != slow) {
            cur.left = sortedListToBST(head);
        }
        cur.right = sortedListToBST(fast);
        return cur;
    }
}

② 将方法提取出来。

class Solution { //1ms
    public TreeNode sortedListToBST(ListNode head) {
       return sortedListToBST(head, null); //注意，因为重写了方法，所以不能省略tail     
    } 
    public TreeNode sortedListToBST(ListNode head, ListNode tail) {
        if (head == tail) {
            return null;
        }
        ListNode slow = head;
        ListNode fast = head;
        while (fast.next != tail && fast.next.next != tail) {
            slow = slow.next;
            fast = fast.next.next;
        }
        TreeNode root = new TreeNode(slow.val);
        root.left = sortedListToBST(head, slow);
        root.right = sortedListToBST(slow.next ,tail);
        return root;
    }
}

转载于:https://my.oschina.net/liyurong/blog/1539944