Leetcode Day12

148. 排序链表【中等】https://leetcode-cn.com/problems/sort-list/

class Solution {
public:
    ListNode* sortList(ListNode* head) {
        return sortList(head, nullptr);
    }

    ListNode* sortList(ListNode* head, ListNode* tail) {
        if (head == nullptr) {
            return head;
        }
        if (head->next == tail) {
            head->next = nullptr;
            return head;
        }
        ListNode* slow = head, *fast = head;
        while (fast != tail) {
            slow = slow->next;
            fast = fast->next;
            if (fast != tail) {
                fast = fast->next;
            }
        }
        ListNode* mid = slow;
        return merge(sortList(head, mid), sortList(mid, tail));
    }

    ListNode* merge(ListNode* head1, ListNode* head2) {
        ListNode* dummyHead = new ListNode(0);
        ListNode* temp = dummyHead, *temp1 = head1, *temp2 = head2;
        while (temp1 != nullptr && temp2 != nullptr) {
            if (temp1->val <= temp2->val) {
                temp->next = temp1;
                temp1 = temp1->next;
            } else {
                temp->next = temp2;
                temp2 = temp2->next;
            }
            temp = temp->next;
        }
        if (temp1 != nullptr) {
            temp->next = temp1;
        } else if (temp2 != nullptr) {
            temp->next = temp2;
        }
        return dummyHead->next;
    }
};

2. 两数相加【中等】https://leetcode-cn.com/problems/add-two-numbers/

class Solution {
public:
    ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
        int ans=0;
        int pre=0;
        ListNode* dummy = new ListNode(-1);
        ListNode* pos = dummy;
        while(l1!=nullptr||l2!=nullptr||pre)
        {
            ans=0;            
            if(l1==nullptr&&l2==nullptr)
            {
                ans=pre;
                pre=0;
            }
        
            else if(l1==nullptr)
            {
                ans +=(l2->val+pre)%10;
                pre = (l2->val+pre)/10;
                l2 = l2->next;
            }
            else if(l2==nullptr)
            {
                ans += (l1->val+pre)%10;
                pre = (l1->val+pre)/10;
                l1 = l1->next;
            }
            else
            {
                ans += (l1->val+l2->val+pre)%10;
                pre = (l1->val+l2->val+pre)/10;
                l1 = l1->next;
                l2 = l2->next;
            }
            ListNode* ln = new ListNode(ans);
            pos->next = ln;
            pos = pos->next;
            cout << pre << endl;
        }
        return dummy->next;
    }
};

31. 下一个排列【中等】https://leetcode-cn.com/problems/next-permutation/

class Solution {
public:
    void nextPermutation(vector<int>& nums) {
        int i = nums.size() - 2;
        while (i >= 0 && nums[i] >= nums[i + 1]) {
            i--;
        }
        if (i >= 0) {
            int j = nums.size() - 1;
            while (j >= 0 && nums[i] >= nums[j]) {
                j--;
            }
            swap(nums[i], nums[j]);
        }
        reverse(nums.begin() + i + 1, nums.end());
    }
};

144. 二叉树的前序遍历【简单】https://leetcode-cn.com/problems/binary-tree-preorder-traversal/

class Solution {
public:
    vector<int> ans;
    void travel(TreeNode* root)
    {
        if(root==nullptr)
            return;
        ans.push_back(root->val);
        travel(root->left);
        travel(root->right);
        return;
    }
    vector<int> preorderTraversal(TreeNode* root) {
        if(root==nullptr)
            return ans;
        travel(root);
        return ans;
    }
};