LeetCode-21. 合并两个有序链表

地址：https://leetcode-cn.com/problems/merge-two-sorted-lists/

思路：对两指针依次比较大小即可，注意对于空链表的处理

Code:

#include<iostream>
#include<algorithm>
#include<vector>
#include<unordered_map>
using namespace std;

struct ListNode {
	int val;
	ListNode *next;
	ListNode(int x) : val(x), next(NULL) {}
};

class Solution {
public:
    ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) {
        ListNode *head=NULL,*p;
        if(l1!=NULL&&l2!=NULL){
			if(l1->val<l2->val){
				head=p=l1;	l1=l1->next;
			}else{
				head=p=l2;	l2=l2->next;
			}
		}else	if(l1!=NULL){
			head=p=l1;	l1=l1->next;
		}else	if(l2!=NULL){
			head=p=l2;	l2=l2->next;
		}
		while(l1!=NULL||l2!=NULL){
			if(l1!=NULL&&l2!=NULL){
				if(l1->val<l2->val){
					p=p->next=l1;	l1=l1->next;
				}else{
					p=p->next=l2;	l2=l2->next;
				}
			}else	if(l1!=NULL){
				p=p->next=l1;	l1=l1->next;
			}else{
				p=p->next=l2;	l2=l2->next;
			}
		}
		return head;
    }
};

int main()
{

	return 0;
}