21. Merge Two Sorted Lists
来源：互联网 发布：疾病基因数据库 编辑：程序博客网 时间：2024/06/07 07:14
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; * struct ListNode *next; * }; */struct ListNode* mergeTwoLists(struct ListNode* l1, struct ListNode* l2) { struct ListNode* L; L=malloc(sizeof(struct ListNode)); L->val=0; struct ListNode* L3=L; while(l1&&l2){ if(l1->val>=l2->val){ L3->next=l2; l2=l2->next; } else{ L3->next=l1; l1=l1->next; } L3=L3->next; } L3->next=l1?l1:l2; return (L->next);} 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
- BootStrap 模态框禁用空白处点击关闭
- 九种编程语言大对比
- MediaCodec之H264编码
- PAT-B 1045. 快速排序(25)
- React Native布局详细指南
- 21. Merge Two Sorted Lists
- PHP基础语法
- queue vector less <int> 从大到小排列
- Qt5 emit总结
- android 工具类utils --01
- usb驱动程序初步编写
- WebView使用详解（一）——Native与JS相互调用（附JadX反编译）
- 深入浅出JMS(一)--JMS基本概念
- Node.js模块、包的学习笔记
