Topic
- Linked List
- Divide and Conquer
- Tree
- Binary Search Tree
- Binary Tree
Description
https://leetcode.com/problems/convert-sorted-list-to-binary-search-tree/
Given the head
of 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 1:
Input: head = [-10,-3,0,5,9]
Output: [0,-3,9,-10,null,5]
Explanation: One possible answer is [0,-3,9,-10,null,5], which represents the shown height balanced BST.
Example 2:
Input: head = []
Output: []
Example 3:
Input: head = [0]
Output: [0]
Example 4:
Input: head = [1,3]
Output: [3,1]
Constraints:
- The number of nodes in head is in the range [ 0 , 2 ∗ 1 0 4 ] [0, 2 * 10^4] [0,2∗104].
- − 1 0 5 < = N o d e . v a l < = 1 0 5 -10^5 <= Node.val <= 10^5 −105<=Node.val<=105
Analysis
用到快慢双指针。
用的时候最好同一起点开始,不然搞得十分混乱。
Submission
import com.lun.util.BinaryTree.TreeNode;
import com.lun.util.SinglyLinkedList.ListNode;
public class ConvertSortedListToBinarySearchTree {
public TreeNode sortedListToBST(ListNode head) {
if (head == null)
return null;
return sortedListToBST(head, null);
}
public TreeNode sortedListToBST(ListNode head, ListNode tail) {
//同一起点
ListNode slow = head;
ListNode fast = head;
if (head == tail)
return null;
while (fast != tail && fast.next != tail) {
fast = fast.next.next;
slow = slow.next;
}
TreeNode thead = new TreeNode(slow.val);
thead.left = sortedListToBST(head, slow);
thead.right = sortedListToBST(slow.next, tail);
return thead;
}
}
Test
import static org.junit.Assert.*;
import org.junit.Test;
import com.lun.util.BinaryTree;
import com.lun.util.BinaryTree.TreeNode;
import com.lun.util.SinglyLinkedList;
import com.lun.util.SinglyLinkedList.ListNode;
public class ConvertSortedListToBinarySearchTreeTest {
@Test
public void test() {
ConvertSortedListToBinarySearchTree cObj = new ConvertSortedListToBinarySearchTree();
ListNode list = SinglyLinkedList.ints2List(-10,-3,0,5,9);
TreeNode actual = cObj.sortedListToBST(list);
TreeNode expected = BinaryTree.of(0,-3,9,-10,null,5);
assertTrue(BinaryTree.equals(actual, expected));
}
}