LeetCode Reverse Linked List
来源:互联网 发布:张逗张花家很富吗 知乎 编辑:程序博客网 时间:2024/06/08 13:12
<pre name="code" class="html">下面是迭代的方法
/** * Definition for singly-linked list. * struct ListNode { * int val; * struct ListNode *next; * }; */struct ListNode* reverseList(struct ListNode* head) { struct ListNode *p = head; //struct ListNode *k= head; if(p){ struct ListNode *q = p->next,*k; while(q){ k = q->next; q->next = p; p = q; q =k; } head->next=NULL; return p; } else return NULL;}
递归的方法如下
0 0
- [LeetCode]Reverse Linked List
- [Leetcode] Reverse Linked List
- leetcode Reverse Linked List
- [LeetCode] Reverse Linked List
- [LeetCode]Reverse Linked List
- Leetcode---Reverse Linked List
- [leetcode] Reverse Linked List
- [leetcode]Reverse Linked List
- Leetcode Reverse Linked List
- [leetcode] Reverse Linked List
- leetcode Reverse Linked List
- Reverse Linked List[LeetCode]
- leetcode--Reverse Linked List
- LeetCode Reverse Linked List
- leetcode: Reverse Linked List
- [leetcode] Reverse Linked List
- LeetCode - Reverse Linked List
- LeetCode || Reverse Linked List
- linux 常用命令
- Activiti 流程部署方式 activi 动态部署(高级源码篇)
- 再按一次退出效果实现 超简单
- android.view.WindowManager$BadTokenException: Unable to add window android.view.ViewRootImpl$W@1ccfe
- POJ 1753 Flip Game
- LeetCode Reverse Linked List
- SQL对表的基本操作
- Windows下编译live555源码
- eterna框架-环境搭建(续)
- leetcode——49——Group Anagrams
- 码农小汪-设计模式-迭代器模式
- Activiti 实战篇 小试牛刀
- DS3231时钟模块应用的一点感悟
- 解决maven项目提示struts action not found