leetcode - Merge Two Sorted Lists
2014-10-15 12:49
267 查看
Merge two sorted linked lists and return it as a new list. The new list should be made by splicing
together the nodes of the first two lists.
together the nodes of the first two lists.
/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */ struct ListNode { int val; ListNode *next; ListNode(int x) : val(x), next(NULL) {} }; class Solution { public: ListNode *mergeTwoLists(ListNode *l1, ListNode *l2) { if(l1 == NULL && l2 == NULL) return NULL; ListNode *node = new ListNode(-1); ListNode *p = node; ListNode *cur = NULL; while (l1 != NULL || l2 != NULL) { if(l1 == NULL) { cur = l2; l2 = l2->next; } else if(l2 == NULL) { cur = l1; l1 = l1->next; } else { if(l1->val > l2->val) { cur = l2; l2 = l2->next; } else { cur = l1; l1 = l1->next; } } p->next = cur; p = p->next; } return node->next; } };
相关文章推荐
- (LeetCode 21)Merge Two Sorted Lists
- leetcode-21 Merge Two Sorted Lists
- LeetCode 第 21 题 (Merge Two Sorted Lists)
- LeetCode 之 Merge Two / k Sorted Lists — C/C++ 实现
- Leetcode 21 Merge Two Sorted Lists
- LeetCode: Merge Two Sorted Lists
- LeetCode-Merge Two Sorted Lists
- leetCode 21. Merge Two Sorted Lists 合并链表
- [leetcode 21] Merge Two Sorted Lists
- LeetCode刷题笔记(链表):merge-two-sorted-lists
- LeetCode: Merge Two Sorted Lists
- LeetCode OJ Merge Two Sorted Lists
- LeetCode 21. Merge Two Sorted Lists
- leetcode 21. Merge Two Sorted Lists
- leetcode Top100 之MaximumSubarray/MergeTwoSortedLists
- LeetCode之“链表”:Merge Two Sorted Lists && Merge k Sorted Lists
- [LeetCode]Merge Two Sorted Lists & Remove Duplicates from Sorted List 两个有序链表合并为一个&删除链表重复元素
- LeetCode(21)Merge Two Sorted Lists
- 【leetcode】Merge Two Sorted Lists
- leetcode Merge Two Sorted Lists