[LeetCode]206. Reverse Linked List 链表反转
2016-09-22 10:58
399 查看
Reverse a singly linked list.
click to show more hints.
Subscribe to see which companies asked this question
代码如下:
click to show more hints.
Subscribe to see which companies asked this question
代码如下:
ListNode* reverseList(ListNode* head) { if(head==NULL||head->next==NULL)return head; ListNode *res,*newnode; res=head; head=head->next; res->next=NULL; while(head) { ListNode *temp=res; newnode=head; head=head->next; newnode->next=temp; res=newnode; } return newnode; }
相关文章推荐
- [leetcode]Reverse Linked List II (反转链表值 C语言实现)
- C实现 LeetCode->Reverse Linked List (双指针大法)(单链表反转)
- leetcode:Reverse Linked List II (反转链表中的一部分)【面试算法题】
- scala反转链表 leetcode 206 Reverse Linked List
- Leetcode Reverse Linked List 反转单链表
- LeetCode 206 Reverse Linked List(反转链表)(四步将递归改写成迭代)(*)
- leetcode解题之206 # Reverse Linked List Java版 (使用头插法反转链表)
- [leetcode] Reverse Linked List II 链表反转
- LeetCode 206. Reverse Linked List - 单链表反转,迭代法和递归法
- [LeetCode] Reverse Linked List(递归与非递归反转链表)
- LeetCode 25 Reverse Nodes in k-Group(在K组链表中反转结点)(Linked List)(*)
- LeetCode206——Reverse Linked List 反转链表
- [Leetcode] Reverse linked list ii 反转链表
- LeetCode中几道链表反转相关题目(Reorder List、Rotate List、Reverse Nodes in k-Group)
- C实现 LeetCode->Reverse Linked List II (双指针大法)(单链表反转)
- [LeetCode-206] Reverse Linked List(链表反转)
- [LeetCode-92] Reverse Linked List II(反转指定区间链表)
- leetcode 92. Reverse Linked List II 反转链表 + 头插入反转链表(或者使用栈)
- LeetCode 206 Reverse Linked List(反转链表)(Linked List)(四步将递归改写成迭代)(*)
- (Leetcode)92. Reverse Linked List II ——反转单链表