[Leetcode]#21 Marge Two Sorted Lists
来源：互联网 发布：海岛奇兵 野人数据 编辑：程序博客网 时间：2024/04/29 04:24
//#21 Marge Two Sorted Lists//12ms 72.02%#include <iostream>using namespace std;/** * 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) { ListNode *new_head(NULL), *p(NULL); if(l1 == NULL) return l2; if(l2 == NULL) return l1; if(l1->val < l2->val) { new_head = l1; l1 = l1->next; } else { new_head = l2; l2 = l2->next; } p = new_head; p->next = NULL; while(l1 != NULL && l2 != NULL) { if(l1->val < l2->val) { p->next = l1; l1 = l1->next; } else { p->next = l2; l2 = l2->next; } p = p->next; p->next = NULL; } if(l1 != NULL) { p->next = l1; } else { p->next = l2; } return new_head; }}; 0 0
- [Leetcode]#21 Marge Two Sorted Lists
- LeetCode(21)Merge Two Sorted Lists
- [LeetCode 21] Merge Two Sorted Lists Solution
- [leetcode 21] Merge Two Sorted Lists
- LeetCode 21:Merge Two Sorted Lists
- LeetCode | #21 Merge Two Sorted Lists
- [Leetcode] 21 - Merge Two Sorted Lists
- leetcode.21------------Merge Two Sorted Lists
- [leetcode]21 Merge Two Sorted Lists
- Leetcode NO.21 Merge Two Sorted Lists
- leetcode[21 链表]Merge Two Sorted Lists
- leetcode-21 Merge Two Sorted Lists
- leetCode #21 Merge Two Sorted Lists
- leetcode 21 Merge Two Sorted Lists
- [Leetcode 21, Easy] Merge Two Sorted Lists
- LeetCode 21 Merge Two Sorted Lists
- Leetcode 21 Merge Two Sorted Lists
- 【leetcode】【单链表】【21】Merge Two Sorted Lists
- ios开发中，关闭由于SEL引起的警告
- [Leetcode]#17 Letter Combinations of a Phone Number
- [Leetcode]#19 Remove Nth Node From End of List
- 公司注册流程
- [Leetcode] #20 Valid Parentheses
- [Leetcode]#21 Marge Two Sorted Lists
- CALayer介绍和隐式动画
- [LeetCode 229] Majority element II
- [Leetcode]#24 Swap Nodes in Pairs
- 第四章线程执行器
- [Leetcode]#26 Remove Duplicates from Sorted Array
- [Leetcode]#27 Remove Elements
- linux kernel编译产生的vmlinux Image zImage之间的关系
- [Leetcode]#28 Implement strStr()
