分类导航

Linux 发布时间：2022-03-31 发布网站：大佬教程 code.js-code.com

大佬教程收集整理的这篇文章主要介绍了(Easy) Reverse linked list LeetCode，大佬教程大佬觉得挺不错的，现在分享给大家，也给大家做个参考。

概述

Description: Reverse a singly linked list. Example: Input: 1->2->3->4->5->NULL Output: 5->4->3->2->1->NULL Follow up: A linked list can be reversed either iteratively or recursively. Could you impl

Description:

Reverse a singly linked list.

Example:

Input: 1->2->3->4->5->NULL
Output: 5->4->3->2->1->NULL

Follow up:

A linked list can be reversed either iteratively or recursively. Could you implement both?

Accepted

661,364

Submissions

1,172,734

Solution:

　　Explanation:

Iterative Method

/**
 * DeFinition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int X) { val = x; }
 * }
 */
class Solution {
    public ListNode reverseList(ListNode head) {
        
        ListNode prev =null,curr = head,next = null;
        
        
        while(curr!=null){
            
            
             next = curr.next; 
            
             curr.next = prev;
            
             prev = curr; 
            
             curr = next;
        }
        
        
        return prev;
        
        
    }
}