leetCode 206. Reverse Linked List 反转链表

206. Reverse Linked List

Reverse a singly linked list.

反转一个链表。

思路：

采用头插法，将原来链表重新插一次返回即可。

代码如下：

/*** 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(NULL == head)return NULL;ListNode *newHead,*p,*q;newHead->next = NULL;p = head;while(p){q = p;p = p->next;q->next = newHead->next;newHead->next = q;}return newHead->next;}
};

2016-08-05 18:59:32

转载于:https://blog.51cto.com/qiaopeng688/1834852

leetCode 206. Reverse Linked List 反转链表相关推荐

LeetCode 206 Reverse Linked List--反转链表--迭代与递归解法--递归使用一个临时变量，迭代使用3个
此题链接:Reverse Linked List - LeetCode Reverse a singly linked list. Example: Input: 1->2->3-> ...
[LeetCode] [C++] 206 Reverse Linked List 反转单项链表
题目要求 Reverse a singly linked list. LeetCode 206在线测试问题描述给定一个单项链表,将其反转后返回链表头节点. 思路分析1 可以完整的遍历一遍链表,将链 ...
Leetcode 206. Reverse Linked List
Similar Questions Reverse Linked List II Binary Tree Upside Down Palindrome Linked List 思路:链表反转. 解法一 ...
LeetCode 206 Reverse Linked List 解题报告
题目要求 Reverse a singly linked list. Example: Input: 1->2->3->4->5->NULL Output: 5-> ...
Java for LeetCode 206 Reverse Linked List
Reverse a singly linked list. 解题思路: 用Stack实现,JAVA实现如下: public ListNode reverseList(ListNode head) {i ...
[swift] LeetCode 206. Reverse Linked List
Reverse a singly linked list. func reverseList(_ head: ListNode?) -> ListNode? {var stack = [Int] ...
leetcode 206 Reverse Linked List
方法一:头插法方法二:递归法 #include<iostream> using namespace std; #include<vector> #include<alg ...
LeetCode Notes_#206 Reverse Linked List（C++,Python）
LeetCode Notes_#206 Reverse Linked List(C++,Python) LeetCode Linked List Contents 题目思路思考解答 C++ P ...
【??链表】LeetCode 92. Reverse Linked List II
LeetCode 92. Reverse Linked List II Solution1: 参考网址:http://www.cnblogs.com/grandyang/p/4306611.html ...

leetCode 206. Reverse Linked List 反转链表

leetCode 206. Reverse Linked List 反转链表相关推荐

最新文章

热门文章