LeetCode206.链表翻转

最新推荐文章于 2024-09-10 15:23:20 发布

suprefan

最新推荐文章于 2024-09-10 15:23:20 发布

阅读量62

点赞数

分类专栏： LeetCode 文章标签：链表 java

本文链接：https://blog.csdn.net/waiter123321/article/details/109388476

版权

LeetCode 专栏收录该内容

56 篇文章 1 订阅

订阅专栏

LeetCode206.链表翻转

链表的翻转是一个比较基础的问题，有3种解法，分别是①通过栈先入后出的特性②迭代③递归

栈解法

class Solution {
    public ListNode reverseList(ListNode head){
        Stack<ListNode> stack = new Stack<>();
        ListNode temp = head;
        while(temp != null){
            stack.push(new ListNode(temp.val));
            temp = temp.next;
        }
        temp = stack.pop();
        ListNode NewHead = temp;
        while(!stack.isEmpty()){
            temp.next = stack.pop();
            temp = temp.next;
        }
        return NewHead;
    }
}

迭代法

class Solution {
    public ListNode reverseList(ListNode head){
        ListNode cur = head;
        ListNode pre = null;
        ListNode temp = null;
        while(cur != null){
            temp = cur.next;
            cur.next = pre;
            pre = cur;
            cur = temp;
        }
        return pre;
    }
}

递归法

class Solution {
    public ListNode reverseList(ListNode head){
        if(head == null || head.next == null)
            return head;
        ListNode NewHead = reverseList(head.next);
        head.next.next = head;
        head.next = null;
        return NewHead;
    }
}