Reverse a doubly linked list hackerrank solution
|
Advertisements This is the Java solution for the Hackerrank problem Reverse a doubly linked list Hackerrank Challenge Java Solution. Source Java-aids repository. /**
*
* Problem Statement-
* [Reverse a doubly linked list](https://www.hackerrank.com/challenges/reverse-a-doubly-linked-list/problem)
*
*/
package com.javaaid.hackerrank.solutions.datastructures.linkedlists;
/**
* @author Kanahaiya Gupta
*
*/
public class ReverseADoublyLinkedList {
class Node {
int data;
Node next;
Node prev;
}
Node Reverse(Node head) {
Node current = head;
Node temp = new Node();
while (current != null) {
temp = current.prev;
current.prev = current.next;
current.next = temp;
head = current;
current = current.prev;
}
return head;
}
}
Curly hair, very fair, please shareRelated
See also Kth Largest Element in a Stream - Leetcode Challenge - Java Solution |
