Modify contents of Linked List | C # implementation to modify the contents of the linked list ; Linked list node ; Function to insert a node at the beginning of the linked list ; allocate node ; put in the data ; link the old list at the end of the new node ; move the head to point to the new node ; Split the nodes of the given list into front and back halves , and return the two lists using the reference parameters . Uses the fast / slow pointer strategy . ; Advance ' fast ' two nodes , and advance ' slow ' one node ; ' slow ' is before the midpoint in the list , so split it in two at that point . ; Function to reverse the linked list ; perfrom the required subtraction operation on the 1 st half of the linked list ; traversing both the lists simultaneously ; subtraction operation and node data modification ; function to concatenate the 2 nd ( back ) list at the end of the 1 st ( front ) list and returns the head of the new list ; function to modify the contents of the linked list ; if list is empty or contains only single node ; split the list into two halves front and back lists ; reverse the 2 nd ( back ) list ; modify the contents of 1 st half ; agains reverse the 2 nd ( back ) list ; concatenating the 2 nd list back to the end of the 1 st list ; pointer to the modified list ; function to print the linked list ; Driver Code ; creating the linked list ; modify the linked list ; print the modified linked list
using System ; class GFG { public class Node { public int data ; public Node next ; } ; static Node push ( Node head_ref , int new_data ) { Node new_node = new Node ( ) ; new_node . data = new_data ; new_node . next = head_ref ; head_ref = new_node ; return head_ref ; } static Node front , back ; static void frontAndBackSplit ( Node head ) { Node slow , fast ; slow = head ; fast = head . next ; while ( fast != null ) { fast = fast . next ; if ( fast != null ) { slow = slow . next ; fast = fast . next ; } } front = head ; back = slow . next ; slow . next = null ; } static Node reverseList ( Node head_ref ) { Node current , prev , next ; current = head_ref ; prev = null ; while ( current != null ) { next = current . next ; current . next = prev ; prev = current ; current = next ; } head_ref = prev ; return head_ref ; } static void modifyTheContentsOf1stHalf ( ) { Node front1 = front , back1 = back ; while ( back1 != null ) { front1 . data = front1 . data - back1 . data ; front1 = front1 . next ; back1 = back1 . next ; } } static Node concatFrontAndBackList ( Node front , Node back ) { Node head = front ; if ( front == null ) return back ; while ( front . next != null ) front = front . next ; front . next = back ; return head ; } static Node modifyTheList ( Node head ) { if ( head == null head . next == null ) return head ; front = null ; back = null ; frontAndBackSplit ( head ) ; back = reverseList ( back ) ; modifyTheContentsOf1stHalf ( ) ; back = reverseList ( back ) ; head = concatFrontAndBackList ( front , back ) ; return head ; } static void printList ( Node head ) { if ( head == null ) return ; while ( head . next != null ) { Console . Write ( head . data + " ▁ - > ▁ " ) ; head = head . next ; } Console . WriteLine ( head . data ) ; } public static void Main ( ) { Node head = null ; head = push ( head , 10 ) ; head = push ( head , 7 ) ; head = push ( head , 12 ) ; head = push ( head , 8 ) ; head = push ( head , 9 ) ; head = push ( head , 2 ) ; head = modifyTheList ( head ) ; Console . WriteLine ( " Modified ▁ List : " ) ; printList ( head ) ; } }