LeetCode | Merge Two Sorted Lists
2013-09-14 19:11
337 查看
题目:
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.思路:
思路很简单,就是遍历两个链表,每次取最小值,直接上代码。代码:
/** * 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 * head = new ListNode(0); ListNode * ptr = head; while(l1 != NULL || l2 != NULL){ ListNode * cur = 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 = l1; l1 = l1->next; } else{ cur = l2; l2 = l2->next; } } ptr->next = cur; ptr = ptr->next; } return head->next; } };
相关文章推荐
- [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-21- Merge Two Sorted Lists(合并两个已排序链表)
- Leetcode 21 Merge Two Sorted Lists
- LeetCode No.21 MergeTwoSortedLists
- [LeetCode] Merge Two Sorted Lists
- Leetcode-Merge Two Sorted Lists
- [leetcode] Merge Two Sorted Lists
- [C语言][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
- LeetCode 之 Merge Two Sorted Lists
- 021-Merge Two Sorted Lists(合并两个排好序的单链表);leetcode
- [Leetcode] Merge Two Sorted Lists