合并两个排序的链表
代码实现
class Solution {
public:
ListNode* mergeTwoLists(ListNode* left, ListNode* right) {
if (!left) return right;
if (!right) return left;
ListNode* head = new ListNode(-1);
ListNode* traverse = head;
while (left && right) {
if (left->val < right->val) {
traverse->next = new ListNode(left->val);
left = left->next;
}
else {
traverse->next = new ListNode(right->val);
right = right->next;
}
traverse = traverse->next;
}
if (left) traverse->next = left;
if (right) traverse->next = right;
return head->next;
}
};
合并K个升序链表
代码实现
class Solution {
private:
ListNode* mergeTwoLists(ListNode* left, ListNode* right) {
if (!left) return right;
if (!right) return left;
ListNode* head = new ListNode(-1);
ListNode* traverse = head;
while (left && right) {
if (left->val < right->val) {
traverse->next = new ListNode(left->val);
left = left->next;
}
else {
traverse->next = new ListNode(right->val);
right = right->next;
}
traverse = traverse->next;
}
if (left) traverse->next = left;
if (right) traverse->next = right;
return head->next;
}
public:
ListNode* mergeKLists(vector<ListNode*>& lists) {
if (lists.empty()) return nullptr;
vector<ListNode*> tmp;
int n = -1;
while (lists.size() > 1) {
n = lists.size();
tmp.clear();
for (int i = 0; i < n; i += 2) {
if (i < n - 1) {
tmp.push_back(mergeTwoLists(lists[i], lists[i + 1]));
}
else {
tmp.push_back(lists[i]);
}
}
lists = tmp;
}
return lists[0];
}
};
剑指 Offer 51. 数组中的逆序对
代码实现
class Solution {
private:
int mergeSort(vector<int>& nums, vector<int>& tmp, int l, int r) {
if (l == r) return 0;
int m = (l + r) >> 1;
int count = mergeSort(nums, tmp, l, m) + mergeSort(nums, tmp, m + 1, r);
int i = l, j = m + 1, pos = l;
while (i <= m && j <= r) {
if (nums[i] <= nums[j]) {
tmp[pos] = nums[i];
i++;
count += j - m - 1;
}
else {
tmp[pos] = nums[j];
j++;
}
pos++;
}
while (i <= m) {
tmp[pos++] = nums[i++];
count += j - m - 1;
}
while (j <= r) {
tmp[pos++] = nums[j++];
}
copy(tmp.begin() + l, tmp.begin() + r + 1, nums.begin() + l);
return count;
}
public:
int reversePairs(vector<int>& nums) {
if (nums.empty()) return {};
int n = nums.size();
vector<int> tmp(n);
return mergeSort(nums, tmp, 0, n - 1);
}
};