推荐社区:万人千题
今日题解
对链表进行插入排序
思路:链表转数组,然后sort排序,再转换成链表
class Solution {
public:
ListNode* insertionSortList(ListNode* head) {
if(head == nullptr) return head;
ListNode* p = head;
vector<int> res;
while(p) {
res.push_back(p->val);
p = p->next;
}
sort(res.begin(), res.end());
p = head;
for(int i=0; i<res.size(); ++i) {
p->val = res[i];
p = p->next;
}
return head;
}
};
合并两个有效数组
思路:合并两个数组,然后sort快排
class Solution {
public:
void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
for (int i = 0; i != n; ++i) {
nums1[m + i] = nums2[i];
}
sort(nums1.begin(), nums1.end());
}
};
思路:双指针+从前向后遍历
class Solution {
public:
void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
int p1 = 0, p2 = 0;
int sorted[m + n];
int cur;
while (p1 < m || p2 < n) {
if (p1 == m) {
cur = nums2[p2++];
} else if (p2 == n) {
cur = nums1[p1++];
} else if (nums1[p1] < nums2[p2]) {
cur = nums1[p1++];
} else {
cur = nums2[p2++];
}
sorted[p1 + p2 - 1] = cur;
}
for (int i = 0; i != m + n; ++i) {
nums1[i] = sorted[i];
}
}
};
有效的三角形是做过的,之前的博客里有