Reverse Linked List
来源:互联网 发布:网站美工设计教程 编辑:程序博客网 时间:2024/06/05 19:52
Reverse a singly linked list.
Solution:
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode* reverseList(ListNode* head) {
if(head==NULL) return NULL;
if(head->next==NULL) return head;
ListNode* p = head->next;
ListNode* n = reverseList(p);
head->next = NULL;
p->next = head;
return n;
}
};
阅读全文
0 0
- Single linked list reverse
- reverse a linked list
- Reverse a linked list.
- Reverse a linked list
- Reverse Linked List II
- Reverse Linked List II
- Reverse Linked List II
- Reverse Linked List II
- Reverse Linked List II
- Reverse Linked List II
- Reverse Linked List II
- Reverse Linked List II
- Reverse Linked List II
- Reverse Linked List II
- Reverse Linked List II
- Reverse Linked List II
- Reverse Linked List II
- Reverse Linked List II
- JS正则表达式元字符
- 【机器学习PAI实践八】用机器学习算法评估学生考试成绩
- laravel 5.4 自定义表单验证
- 幼儿园作业(毕业季)
- 移动POS机五大安全问题
- Reverse Linked List
- Linux 网络调试
- 简易Fgf游戏
- mysql---使用操作符过滤数据
- public static void main(String [] args) 中static能否去掉?为什么?
- 每天一个Linux命令(36):diff命令
- 一个简单实例轻松看懂 Java WebService
- JMeter classpath
- Delete Node in a Linked List