标签:leetcode解题报告 算法 面试题 递归 二叉树
Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.public class Solution { ListNode getLeftNodeFromList(ListNode head) { ListNode next = head; ListNode current = head; ListNode pre = head; while(next!=null) { next = next.next; if(next==null) { break; } next = next.next; if(next==null) { break; } pre = head; head = head.next; } return pre; } public TreeNode sortedListToBST(ListNode head) { if(head==null) { return null; } if(head.next==null) { return new TreeNode(head.val); } ListNode left = getLeftNodeFromList(head); ListNode mid = left.next; TreeNode root = new TreeNode(mid.val); left.next = null; root.left = sortedListToBST(head); root.right = sortedListToBST(mid.next); return root; } }
LeetCode Convert Sorted List to Binary Search Tree 解题报告
标签:leetcode解题报告 算法 面试题 递归 二叉树
原文地址:http://blog.csdn.net/worldwindjp/article/details/39722643