how to reverse a LinkedList

/*

    Following is the Node class already written for the Linked List

    class Node<T> {
        T data;
        Node<T> next;
    
        public Node(T data) {
            this.data = data;
        }
    }

*/

public class Solution {              
                                                 
    public static void printReverse(Node<Integer> root) {
        if(root==null) return;
        printReverse(root.next); 
        System.out.print(root.data+" "); 
    }
}


this is recursive call 

jisme first in last out hoga 

lets suppose 1   2   3   4 ye ek linkedList hai

ab ham printRever(root.next) se function ko recursive call kar rhe

jisme sabse phle 1 hoga phir check karega root next hai ? nhi hai to dubara recursive
call hoga 2 ko check karega ye v nhi hai
3 ko check karega ye v nhi hai null
4 ko check karega ye v nhi hai null
ab jaise hi 4 ho jayega ye oppositve direction me print krna suru kr dega 
4 to 3 to 2 to 1 aur is tarh se ye reverse ho jayega

Comments

Add CSS using external CSS

>>> U just need to create a another page and save it with the name style.css >>> and then go to link that style page with your html docs how to link your css with html page ? >>> You can find code below , it will help you to link your external page with your html docs <!DOCTYPE html> <html> <head> <meta charset="utf-8"> <meta name="viewport" content="width=device-width, initial-scale=1"> <title>Divyanshu Khare || MERN Developer</title> <meta description = "description" content="Divyanshu Khare's website"> <link rel="stylesheet" type="text/css" href="style.css">  </head> <body> </body> </html>

Python

Indexing-- it will help u to fetch single character string= "Python" string[2] # slicing process of fetching a sub-string from the given string #sequence of charater we can fetch means more than 1 character string="Divyanshu" string[2:4+1] #basically here number is index value #string[start_index:end+index+1] string = "Hunny" #indexing agr positive hai to left se count hoga #right se negative me string[:] #it will give u entire string #now If i want to any characterwise index like string is Hunny and I want un only #string[start_index:end_index+1:step] string[1:4:2] #reverse your string #string[:: -1] string="Baba hunny" string[:: -1] # to convert into lowecase string="New Divyanshu" new_string=string.lower() #new_string becase we've to create another string print(new_string) s1={1,2,3,4,5} s2={3,2,8,67,85} s3=s1.union(s2) s3 #isme add hota hai whole value lekin common value update nhi hongi #intersection - ...

Find Unique Number in Array Java , XOR

Question: WAP to find unique number in Array Java package aRray ; import java . util .*; public class practicalArray { public static void main ( String [] args ) { Scanner scan = new Scanner ( System . in ) ; // Step 1: Input size of the array from the user int size = scan . nextInt () ; // Step 2: Create an integer array of the specified size int [] arr = new int [ size ] ; // Step 3: Initialize 'res' with the first element of the array int res = arr [ 0 ] ; // Step 4: Loop to read array elements and find the unique number for ( int i = 1 ; i < size ; i ++ ) { // Read an integer from the user and store it in the array arr [ i ] = scan . nextInt () ; // Step 5: Use XOR (^) operation to find the unique number res = res ^ arr [ i ] ; } // Step 6: Print the unique number System . out . print...

DivBytes

Search This Blog