LeetCode 21. Merge Two Sorted Lists
2017-09-18 15:30
375 查看
Merge Two Sorted 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 ans(1); ListNode *list = &ans; while(l1 != nullptr && l2 != nullptr){ if(l1->val <= l2->val){ list->next = l1; l1 = (l1->next); }else{ list->next = l2; l2 = (l2->next); } list = list->next; } list->next = l1 ? l1 : l2; return ans.next; } };
相关文章推荐
- LeetCode@LinkedList_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: (21) Merge Two Sorted Lists
- [LeetCode]21. Merge Two Sorted Lists
- LeetCode - 21. Merge Two Sorted Lists
- [LeetCode] 21 - Merge Two Sorted Lists
- (Java)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 21 Merge Two Sorted Lists (有序两个链表整合)
- leetcode_21题——Merge Two Sorted Lists(链表)
- LeetCode 21 Merge Two Sorted Lists 把两个链表有序连接
- Leetcode-21 Merge Two Sorted Lists