错误:
/**
* struct ListNode {
* int val;
* struct ListNode *next;
* ListNode(int x) : val(x), next(nullptr) {}
* };
*/
#include <cstdio>
#include <cstdlib>
#include <vector>
class Solution {
public:
/**
* 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可
*
*
* @param pHead1 ListNode类
* @param pHead2 ListNode类
* @return ListNode类
*/
ListNode* Merge(ListNode* pHead1, ListNode* pHead2) {
// write code here
if (pHead1 == NULL && pHead2 == NULL) {
return NULL;
}
if (pHead1 == NULL && pHead2 != NULL) {
return pHead2;
}
if (pHead1 != NULL && pHead2 == NULL) {
return pHead1;
}
vector<int>v;
while (pHead1 != NULL) {
v.push_back(pHead1->val);
pHead1 = pHead1->next;
}
while (pHead2 != NULL) {
v.push_back(pHead2->val);
pHead2 = pHead2->next;
}
sort(v.rbegin(),v.rend());
ListNode* head = (struct ListNode*)malloc(sizeof(struct ListNode));
ListNode* move = (struct ListNode*)malloc(sizeof(struct ListNode));
head->val=v.back();
v.pop_back();
head->next=NULL;
move=head;
for(int i=0;i<v.size();i++){
printf("%d\n",v.at(i));
}
for(int i=0;i<v.size()-1;i++){
printf("%d\n",v.back());
ListNode* node = (struct ListNode*)malloc(sizeof(struct ListNode));
node->val=v.back();
// printf("%d\n",node->val);
v.pop_back();
move->next=node;
move=move->next;
move->next=NULL;
}
return head;
}
};
for(int i=0;i<v.size()-1;i++){
....
}
错误原因:
在for循迹里面,每经过一次v.pop_back()之后,v的大小就会减小,是会发生变化的!!所以该循环条件是错误的。
正确:
/**
* struct ListNode {
* int val;
* struct ListNode *next;
* ListNode(int x) : val(x), next(nullptr) {}
* };
*/
#include <cstdio>
#include <cstdlib>
#include <vector>
class Solution {
public:
/**
* 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可
*
*
* @param pHead1 ListNode类
* @param pHead2 ListNode类
* @return ListNode类
*/
ListNode* Merge(ListNode* pHead1, ListNode* pHead2) {
// write code here
if (pHead1 == NULL && pHead2 == NULL) {
return NULL;
}
if (pHead1 == NULL && pHead2 != NULL) {
return pHead2;
}
if (pHead1 != NULL && pHead2 == NULL) {
return pHead1;
}
vector<int>v;
while (pHead1 != NULL) {
v.push_back(pHead1->val);
pHead1 = pHead1->next;
}
while (pHead2 != NULL) {
v.push_back(pHead2->val);
pHead2 = pHead2->next;
}
sort(v.rbegin(),v.rend());
ListNode* head = (struct ListNode*)malloc(sizeof(struct ListNode));
ListNode* move = (struct ListNode*)malloc(sizeof(struct ListNode));
head->val=v.back();
v.pop_back();
head->next=NULL;
move=head;
while(!v.empty()){
printf("%d\n",v.back());
ListNode* node = (struct ListNode*)malloc(sizeof(struct ListNode));
node->val=v.back();
// printf("%d\n",node->val);
v.pop_back();
move->next=node;
move=move->next;
move->next=NULL;
}
return head;
}
};
while(!v.empty()){
....
}