leetcode Reverse Linked List

Reverse a singly linked list

对于这种可以修改值的，把值逆序就可以了。。。。用vector存，然后逆序读。

都忘了指针怎么赋值初始化了。*p=&head;

 1 /**
 2  * Definition for singly-linked list.
 3  * struct ListNode {
 4  *     int val;
 5  *     ListNode *next;
 6  *     ListNode(int x) : val(x), next(NULL) {}
 7  * };
 8  */
 9  class Solution {
10 public:
11     ListNode* reverseList(ListNode* head) {
12         if(head==NULL) return NULL;
13         vector<int> List1;
14         ListNode* p,*q;
15         p=head,q=head;
16         while(p!=NULL){
17             List1.push_back(p->val);
18             p=p->next;
19         }
20         int s=List1.size();
21         for(int i=s-1;i>=0;i--){
22             q->val=List1[i];
23             q=q->next;
24         }
25         return head;
26     }
27 };

转载于:https://www.cnblogs.com/LUO77/p/4972569.html

leetcode Reverse Linked List相关推荐

LeetCode | Reverse Linked List II
这道链表反转题也是搞的我焦头烂额,好久没有写链表了,注意记忆这些 Reverse Linked List II QuestionEditorial Solution My Submissions To ...
Leetcode: Reverse Linked List II
Reverse a linked list from position m to n. Do it in-place and in one-pass.For example: Given 1-> ...
[LeetCode] Reverse Linked List II
Reverse a linked list from position m to n. Do it in-place and in one-pass. For example: Given 1-> ...
leetcode : Reverse Linked List II [two pointers]
Reverse a linked list from position m to n. Do it in-place and in one-pass. For example: Given 1-> ...
[LeetCode] Reverse Linked List I II - 链表翻转问题
题目概述: Reverse a singly linked list. 翻转一个单链表,如:1->2 输出 2->1:1->2->3 输出3-& ...
LeetCode Reverse Linked List II
链表局部反转问题代码如下: class Solution {public ListNode reverseBetween(ListNode head, int m, int n) {if (m == ...
LeetCode Reverse Linked List II 反置链表2
题意:将指定的一段位置[m,n]的链表反置,返回链表头. 思路:主要麻烦在链表头,如果要从链表头就开始,比较特殊. 目前用DFS实现,先找到m-1的位置,再找到n+1的位置,中间这段就是否要反置的,交 ...
LeetCode 92. Reverse Linked List II--Python 解法--反转部分链表--笔试算法题
题目地址:Reverse Linked List II - LeetCode Reverse a linked list from position m to n. Do it in one-pass ...
LeetCode 206 Reverse Linked List--反转链表--迭代与递归解法--递归使用一个临时变量，迭代使用3个
此题链接:Reverse Linked List - LeetCode Reverse a singly linked list. Example: Input: 1->2->3-> ...

leetcode Reverse Linked List

leetcode Reverse Linked List相关推荐

最新文章

热门文章