解题思路
206. 反转链表
该题有三种思路:
- 利用栈来达到反转链表的作用
- 迭代,对原链表进行变化
- 递归
代码
方法一:栈
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode() {}
* ListNode(int val) { this.val = val; }
* ListNode(int val, ListNode next) { this.val = val; this.next = next; }
* }
*/
class Solution {
public static ListNode reverseList(ListNode head) {
Deque<ListNode> stack = new LinkedList<>();
ListNode reverse_node = new ListNode(0);
ListNode dummy_node = reverse_node;
while(head!=null) { //先遍历链表,把链表中的所有节点都存入栈中
stack.push(head);
head = head.next;
}
while(!stack.isEmpty()) { //遍历栈中所有节点,从而达到反转链表的作用
dummy_node.next = stack.pop();
dummy_node = dummy_node.next;
if(stack.isEmpty()) {
dummy_node.next = null;
}
}
return reverse_node.next;
}
}
方法二:迭代
class Solution {
public static ListNode reverseList(ListNode head) {
ListNode prev = null; //保留前一个节点
while(head!=null) {
ListNode next_node =head.next; //保留下一个节点
head.next = prev;
prev = head;
head = next_node;
}
return prev;
}
}
方法三:递归
class Solution {
//迭代 reverseList3: 对头节点是head的链表进行反转
public static ListNode reverseList(ListNode head) {
if(head == null || head.next == null) {
return head;
}
//对头节点后的所有节点进行反转
ListNode newNode = reverseList(head.next);
//然后对头节点进行处理: head.next 指向head,然后head指向null
head.next.next = head;
head.next = null;
return newNode;
}
}