21. Merge Two Sorted Lists
来源：互联网 发布：mac系统如何卸载软件 编辑：程序博客网 时间：2024/05/13 14:46
1、要求
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.
2、代码（递归）
/** * 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 == NULL) return l2; if(l2 == NULL) return l1; if(l1->val < l2->val) { l1->next = mergeTwoLists(l1->next, l2); return l1; } else { l2->next = mergeTwoLists(l2->next, l1); return l2; } }}; 0 0
- 21.Merge Two Sorted Lists
- 21. Merge Two Sorted Lists
- 21. Merge Two Sorted Lists
- 21. Merge Two Sorted Lists
- 21. Merge Two Sorted Lists
- 21. Merge Two Sorted Lists
- 21.Merge Two Sorted Lists
- 21. Merge Two Sorted Lists
- 21. Merge Two Sorted Lists
- 21. Merge Two Sorted Lists
- 21. Merge Two Sorted Lists
- 21. Merge Two Sorted Lists
- 21. Merge Two Sorted Lists
- 21. Merge Two Sorted Lists
- 21. Merge Two Sorted Lists
- 21. Merge Two Sorted Lists
- 21. Merge Two Sorted Lists
- 21. Merge Two Sorted Lists
- 费马小定理 -- 讲解
- BZOJ-1854 游戏 二分图匹配 （并查集）
- html文章font-family字体集合
- <init>和<cinit>
- 树形结构的处理——组合模式
- 21. Merge Two Sorted Lists
- 5. Longest Palindromic Substring
- 验证尼科彻斯定理
- 整数的幂分解
- 安卓自定义组合控件的实现
- 二叉树的线索化
- seajs模块化开发初探
- 算法的封装与切换——策略模式
- 2016第一篇博客，对近2个多月学习的总结
