Breaking News: Grepper is joining You.com. Read the official announcement!

reversing the linked list

hritick bhushan answered on May 28, 2021 Popularity 9/10 Helpfulness 3/10

answer reversing the linked list

reversing the linked list

Comment

// Java program for reversing the linked list
 
class LinkedList {
 
    static Node head;
 
    static class Node {
 
        int data;
        Node next;
 
        Node(int d)
        {
            data = d;
            next = null;
        }
    }
 
    /* Function to reverse the linked list */
    Node reverse(Node node)
    {
        Node prev = null;
        Node current = node;
        Node next = null;
        while (current != null) {
            next = current.next;
            current.next = prev;
            prev = current;
            current = next;
        }
        node = prev;
        return node;
    }
 
    // prints content of double linked list
    void printList(Node node)
    {
        while (node != null) {
            System.out.print(node.data + " ");
            node = node.next;
        }
    }
 
    // Driver Code
    public static void main(String[] args)
    {
        LinkedList list = new LinkedList();
        list.head = new Node(85);
        list.head.next = new Node(15);
        list.head.next.next = new Node(4);
        list.head.next.next.next = new Node(20);
 
        System.out.println("Given Linked list");
        list.printList(head);
        head = list.reverse(head);
        System.out.println("");
        System.out.println("Reversed linked list ");
        list.printList(head);
    }
}
 
// This code has been contributed by Mayank Jaiswal

Popularity 9/10 Helpfulness 3/10 Language java

Source: www.geeksforgeeks.org

Tags: java linked-list reversing

Link to this answer
Share Copy Link

Contributed on Jun 06 2022

hritick bhushan

0 Answers Avg Quality 2/10

Closely Related Answers

linked list revrse

Comment

//iterative
public ListNode ReverseList(ListNode head) 
{
    ListNode prev = null;
    var current= head;

    while(current!=null)
    {
        var next = current.next;
        current.next=prev;
        prev =current;
        current=next;
    }
    return prev;
}
// recursive
public ListNode ReverseList(ListNode head) 
{
    if(head==null || head.next == null)
        return head;

    var t2 = ReverseList(head.next);
    head.next.next = head;
    head.next = null;

    return t2;
}

Popularity 10/10 Helpfulness 2/10 Language csharp

Source: leetcode.com

Tags: c# c

Link to this answer
Share Copy Link

Contributed on Jul 07 2022

PrashantUnity

0 Answers Avg Quality 2/10

reverse a linked list

Comment

/**
 * 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 ListNode reverseList(ListNode head) {
        
        ListNode current = head;
        ListNode prev = null;
        ListNode next = null;
        
        if(head == null)
        {
            return head;
        }
        while(current != null)
        {
            next = current.next;
            current.next = prev;
            prev = current;
            current = next;
        }
        return prev;
    }
}

Popularity 10/10 Helpfulness 2/10 Language java

Source: Grepper

Tags: java

Link to this answer
Share Copy Link

Contributed on Aug 19 2022

Aditya jha

0 Answers Avg Quality 2/10

Reverse a Linked List

Comment

	    /* Before changing next pointer of current node,
        store the next node */
        next = curr -> next
        /*  Change next pointer of current node */
        /* Actual reversing */
        curr -> next = prev
        /*  Move prev and curr one step ahead */
        prev = curr
        curr = next

Popularity 10/10 Helpfulness 2/10 Language whatever

Source: www.faceprep.in

Tags: linked-list link

Link to this answer
Share Copy Link

Contributed on Jun 30 2021

Frantic Finch

0 Answers Avg Quality 2/10

Reverse a Linked List

Comment

-1

void reverse()
	{
		node* current, * prev, * temp;
		current = head;
		prev = NULL;
		while (current != NULL)
		{
			temp = current->next;
			current->next = prev;
			prev = current;
			current = temp;
		}
		head = prev;
	}

Popularity 10/10 Helpfulness 1/10 Language cpp

Source: Grepper

Tags: c++

Link to this answer
Share Copy Link

Contributed on Apr 28 2022

ANISH SINGH

0 Answers Avg Quality 2/10

Revese a Linked List

Comment

LinkedList<Integer> ll = new LinkedList<>();

ll.add(1);
ll.add(2);
ll.add(3);
System.out.println(ll);

LinkedList<Integer> ll1 = new LinkedList<>();

ll.descendingIterator().forEachRemaining(ll1::add);

System.out.println(ll1);

Popularity 10/10 Helpfulness 1/10 Language whatever

Source: www.journaldev.com

Tags: linked-list link

Link to this answer
Share Copy Link

Contributed on May 28 2021

Wandering Wolverine

0 Answers Avg Quality 2/10

reversing the linked list

Contents

More Related Answers

reversing the linked list

Closely Related Answers

linked list revrse

reverse a linked list

Reverse a Linked List

Reverse a Linked List

Revese a Linked List

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.