/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
public class Solution {
public ListNode reverseList(ListNode head) {
ListNode pre=null;
while(head!=null){
ListNode tmp=head.next;
head.next=pre;
pre=head;
head=tmp;
}
return pre;
}
}
**206. Reverse Linked List **Reverse a singly linked list...
206. Reverse Linked List Reverse a singly linked list. Hi...
题目206. Reverse Linked List Reverse a singly linked list.c...
206. Reverse Linked List Reverse a singly linked list. Ex...
链表逆序 206. Reverse Linked List 92. Reverse Linked List II ...
D78 206. Reverse Linked List 题目链接 206. Reverse Linked Lis...
237. Delete Node in a Linked List 206. Reverse Linked Lis...
Leetcode 206. Reverse Linked List. 【Easy】【Green】 Leetcode...
206. Reverse Linked List 题目:https://leetcode.com/problems...
206. Reverse Linked List --- Easy[https://leetcode.com/pr...
本文标题：206. Reverse Linked List
本文链接：https://www.haomeiwen.com/subject/epuvmttx.html
网友评论