- 转载请注明作者和出处:http://blog.csdn.net/u011475210
- 代码地址:https://github.com/WordZzzz/Note/tree/master/LeetCode
- 刷题平台:https://www.nowcoder.com/ta/leetcode
- 题 库:Leetcode经典编程题
- 编 者:WordZzzz
题目描述
Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.
解题思路
升序链表转换成高度平衡的二叉搜索树,我们只需要找到链表的中点当作root然后左右递归就可以了。求链表中点当然还是用快慢指针了。
C++版代码实现
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
/**
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
TreeNode *sortedListToBST(ListNode *head) {
return toBST(head, NULL);
}
TreeNode *toBST(ListNode *head, ListNode *tail){
if(head == tail)
return NULL;
ListNode *fast = head;
ListNode *slow = head;
while(fast != tail && fast->next != tail){
slow = slow->next;
fast = fast->next->next;
}
TreeNode *root = new TreeNode(slow->val);
root->left = toBST(head, slow);
root->right = toBST(slow->next, tail);
return root;
}
};
系列教程持续发布中,欢迎订阅、关注、收藏、评论、点赞哦~~( ̄▽ ̄~)~
完的汪(∪。∪)。。。zzz