1、題目描述:
輸入一個鏈表,反轉鏈表後,輸出鏈表的所有元素。
/*
struct ListNode {
int val;
struct ListNode *next;
ListNode(int x):val(x), next(NULL) {
}
};*/
class Solution {
public:
ListNode* ReverseList(ListNode* pHead) {
if(pHead && pHead->next){
ListNode *t = NULL;
ListNode *p = pHead;
ListNode *q = pHead->next;
while( q )
{
t = q->next;
q->next = p;
p = q;
q = t;
}
pHead->next = NULL;
pHead = p;
}
return pHead;
}
};
2、題目描述:
輸入兩個單調遞增的鏈表,輸出兩個鏈表合成後的鏈表,當然我們需要合成後的鏈表滿足單調不減規則。
/*
struct ListNode {
int val;
struct ListNode *next;
ListNode(int x):val(x), next(NULL) {
}
};*/
class Solution {
public:
ListNode* Merge(ListNode* pHead1, ListNode* pHead2)
{
if(pHead1 == nullptr) return pHead2;
if(pHead2 == nullptr) return pHead1;
ListNode *MergeHead = nullptr;
if(pHead1->val < pHead2->val){
MergeHead = pHead1;
MergeHead->next = Merge(pHead1->next, pHead2);
}else{
MergeHead = pHead2;
MergeHead->next = Merge(pHead1, pHead2->next);
}
return MergeHead;
}
};
如有建議或其他問題,可隨時給我們留言。或者到以下鏈接:
Star/Fork/Push 您的代碼,開源倉庫需要您的貢獻。
請查看Coding 題目網址和收藏Accepted代碼倉庫,進行coding!!!