Leetcode#206Reverse Linked List

反转链表

public class Solution {

public ListNode reverseList(ListNode head) {

ListNode H=new ListNode(0);

H.next=null;

ListNode p=head;

while(p!=null)

{

ListNode x=p;

p=p.next;

x.next=H.next;

H.next=x;

}

return H.next;

}

转载于:https://blog.51cto.com/7061299/1641964

Leetcode#206Reverse Linked List相关推荐

Leetcode 142 Linked List Cycle II
Given a linked list, return the node where the cycle begins. If there is no cycle, return null. Foll ...
Leetcode 142. Linked List Cycle II
地址:Leetcode 142. linked list Cycle II 问题描述:检测链表是否存在环,是的话返回环入口,否则返回None. 这道题有两个思路,一个是经典的快慢指针的思路,另外一个是 ...
【To Do】LeetCode 142. Linked List Cycle II
LeetCode 142. Linked List Cycle II Solution1:我的答案这道题多次遇到,牢记此解法这道题要深思一下,快指针和慢指针的速度对比不同,会产生什么不同的结果? ...
LeetCode 142. Linked List Cycle II--单向链表成环的起点--C++,Python解法
题目地址:Linked List Cycle II - LeetCode Given a linked list, return the node where the cycle begins. If ...
LeetCode 141. Linked List Cycle--面试编程题--C++,Python解法
题目地址:Linked List Cycle - LeetCode Given a linked list, determine if it has a cycle in it. To represe ...
LeetCode 817. Linked List Components
原题链接在这里:https://leetcode.com/problems/linked-list-components/ 题目: We are given head, the head node o ...
leetcode 382. Linked List Random Node | 382. 链表随机节点（Java）
题目 https://leetcode.com/problems/linked-list-random-node/ 题解先存起来,再随机返回即可.不知道在考察什么? /*** Definition ...
LeetCode 141. Linked List Cycle （链表循环）
Given a linked list, determine if it has a cycle in it. Follow up: Can you solve it without using ex ...
LeetCode | Reverse Linked List II
这道链表反转题也是搞的我焦头烂额,好久没有写链表了,注意记忆这些 Reverse Linked List II QuestionEditorial Solution My Submissions To ...

Leetcode#206Reverse Linked List

Leetcode#206Reverse Linked List相关推荐

最新文章

热门文章