[leetcode]Merge Two Sorted Lists合并两个有序链表
2019-05-25 07:20
330 查看
目录
1,题目描述
中文
2,代码实现
[code]/** * 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) { if(l1==nullptr){ return l2; } if(l2==nullptr){ return l1; } ListNode* res = nullptr; if(l1->val <= l2->val){ res = l1; l1 = l1->next; } else{ res = l2; l2 = l2->next; } ListNode* head = res; while(l1!=nullptr && l2!=nullptr){ if(l1->val <= l2->val){ head->next = l1; head = head->next; l1 = l1->next; } else{ head->next = l2; head = head->next; l2 = l2->next; } } head->next = l1 != nullptr ? l1: l2; return res; } };
相关文章推荐
- [LeetCode] Merge Two Sorted Lists 合并两个有序链表
- [LeetCode-21] Merge Two Sorted Lists(合并两个有序链表)
- 面试题17:合并两个有序链表(Leetcode-21:Merge Two Sorted Lists)
- [LeetCode] 21. Merge Two Sorted Lists 合并两个有序链表 @python
- Leetcode Merge Two Sorted Lists 合并两个有序链表
- [LeetCode]Merge Two Sorted Lists & Remove Duplicates from Sorted List 两个有序链表合并为一个&删除链表重复元素
- [LeetCode 21]Merge Two Sorted Lists 合并两个有序链表
- LeetCode--Merge Two Sorted Lists(合并两个有序链表)Python
- leetcode Merge Two Sorted Lists 合并两个有序链表
- LeetCode-21 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 21. Merge Two Sorted Lists (合并两个有序链表)
- [LeetCode21]Merge Two Sorted Lists(合并两个有序链表)
- Merge Two Sorted Lists 合并两个有序链表@LeetCode
- [leetcode]Merge Two Sorted Lists合并两个有序链表2
- LeetCode 刷题: 合并两个有序链表 (merge two sorted list)
- Leetcode:Merge Two Sorted Lists 合并两个有序单链表