考研算法练习一：有序链表转换为平衡二叉树

有序链表转换为平衡二叉树

解题思路，找每次子序列的中位数作为本次子树的根，然后再递归迭代以该中位数为分割点的左子序列和右子序列，循环递归下去即可

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode() : val(0), next(nullptr) {}
 *     ListNode(int x) : val(x), next(nullptr) {}
 *     ListNode(int x, ListNode *next) : val(x), next(next) {}
 * };
 */
/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    // end 默认值为 nullptr
    ListNode* findMidNode(ListNode* start, ListNode* end){
        ListNode* fast = start;
        ListNode* slow = start;
        while(fast !=end && fast->next != end){
            slow = slow->next;
            fast = fast->next->next;
        }
        return slow;
    }

    TreeNode* createTreeNode(){
        TreeNode* node = (TreeNode*)malloc(sizeof(TreeNode));
        node->left = NULL;
        node->right = NULL;
        return node; 
    }

    TreeNode* translateLinkListToAVL(ListNode* start,ListNode* end){
        if(start == end || start == NULL) return NULL;
        TreeNode* node = createTreeNode();
        if(start->next == end){
            node->val = start->val;
            return node;
        }
        ListNode* midNode = findMidNode(start,end);
        if(midNode != NULL){
            node->val = midNode->val;
            node->left = translateLinkListToAVL(start,midNode);
            node->right = translateLinkListToAVL(midNode->next,end);
            return node;
        }
        return NULL;
    }

    TreeNode* sortedListToBST(ListNode* head) {
        if(head == NULL) return NULL;
        return translateLinkListToAVL(head,NULL);
    }
};