leetcode之Merge Two Sorted Lists
来源:互联网 发布:北汽股份 营销网络 编辑:程序博客网 时间:2024/06/07 11:53
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode *mergeTwoLists(ListNode *l1, ListNode *l2) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
if (l1 == NULL)
return l2;
if (l2 == NULL)
return l1;
ListNode* head;
ListNode* pos1 = l1;
ListNode* pos2 = l2;
if (l1->val > l2->val) {
head = l2;
pos2 = l2->next;
} else {
head = l1;
pos1 = pos1->next;
}
ListNode* pos = head;
while (pos1!=NULL && pos2!=NULL) {
if (pos1->val <= pos2->val) {
pos->next = pos1;
pos1=pos1->next;
} else {
pos->next = pos2;
pos2=pos2->next;
}
pos = pos->next;
}
if (pos1 == NULL&&pos2==NULL) {
return head;
} else if (pos1 !=NULL) {
pos->next = pos1;
} else {
pos->next = pos2;
}
return head;
}
};
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode *mergeTwoLists(ListNode *l1, ListNode *l2) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
if (l1 == NULL)
return l2;
if (l2 == NULL)
return l1;
ListNode* head;
ListNode* pos1 = l1;
ListNode* pos2 = l2;
if (l1->val > l2->val) {
head = l2;
pos2 = l2->next;
} else {
head = l1;
pos1 = pos1->next;
}
ListNode* pos = head;
while (pos1!=NULL && pos2!=NULL) {
if (pos1->val <= pos2->val) {
pos->next = pos1;
pos1=pos1->next;
} else {
pos->next = pos2;
pos2=pos2->next;
}
pos = pos->next;
}
if (pos1 == NULL&&pos2==NULL) {
return head;
} else if (pos1 !=NULL) {
pos->next = pos1;
} else {
pos->next = pos2;
}
return head;
}
};
- leetcode之Merge Two Sorted Lists
- LeetCode 之Merge Two Sorted Lists
- LeetCode之Merge Two Sorted Lists
- LeetCode之Merge Two Sorted Lists
- LeetCode之Merge Two Sorted Lists
- LeetCode之Merge Two Sorted Lists
- 【Leetcode】之Merge Two Sorted Lists
- LeetCode 之 Merge Two Sorted Lists
- leetcode之Merge Two Sorted Lists
- leetcode 之 Merge two sorted lists
- leetcode之Merge Two Sorted Lists
- LeetCode之21----Merge Two Sorted Lists
- Leetcode 之 Merge Two Sorted Lists
- LeetCode之Merge Two Sorted Lists
- leetcode 之 Merge Two Sorted Lists
- LeetCode: Merge Two Sorted Lists
- [Leetcode] Merge Two Sorted Lists
- Leetcode: Merge Two Sorted Lists
- 各种内部排序
- GSL安装的安装及配置过程
- Linux网络协议栈QoS模块(TC)的设计与实现
- 有关 Direct3D技术的初步探索-------矩阵变换
- contentprovider的学习实例总结
- leetcode之Merge Two Sorted Lists
- 奇葩的各种算法
- MyEclipse创建EJB3.0
- android 获取路径目录方法以及判断目录是否存在,创建目录
- Exercises 4.1
- java实现点卡生成
- 让ProgressDialog在setCancelable(false)时按返回键可dismiss
- 我是程序猿-热门专业
- C/C++中的运算符优先级总结