Merge Two Sorted Lists
来源:互联网 发布:鼠标指针美化软件 编辑:程序博客网 时间:2024/04/30 18:12
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) { // IMPORTANT: Please reset any member data you declared, as // the same Solution instance will be reused for each test case. if(l1 == NULL) return l2; if(l2 == NULL) return l1; ListNode *head = NULL; if(l1->val <= l2->val){ head = l1; head->next = mergeTwoLists(l1->next, l2); } else { head = l2; head->next = mergeTwoLists(l1, l2->next); } return head; }};
- Merge Two Sorted Lists
- Merge Two Sorted Lists
- Merge Two Sorted Lists
- Merge Two Sorted Lists
- Merge Two Sorted Lists
- Merge Two Sorted Lists
- Merge Two Sorted Lists
- Merge Two Sorted Lists
- Merge Two Sorted Lists
- Merge Two Sorted Lists
- Merge Two Sorted Lists
- Merge Two Sorted Lists
- Merge Two Sorted Lists
- Merge Two Sorted Lists
- Merge Two Sorted Lists
- Merge Two Sorted Lists
- Merge Two Sorted Lists
- Merge Two Sorted Lists
- environments was not found on the java.library.path 如何解决
- #define用法集锦
- UVA 10334 - Ray Through Glasses(高精度斐波那契)
- v8学习---添加js全局函数
- word里 怎么样自动生成目录
- Merge Two Sorted Lists
- 如何判断对象是否数组?
- HDOJ 2059 龟兔赛跑
- OK6410挂在nfs文件系统
- Android四大基本组件介绍与生命周期
- TinyOS研究链接
- 插头DP——从不会到入门(POJ 2411,HDU 1565,HDU 2167,HDU 1693,Ural 1519)
- Linux下设置静态IP和获取动态IP的方法
- Android四大(五大)基本组件简介