Delete Node Linked List - Day 2

Author: suriyakrishna

src/main/java/com/kishan/java/leetcode/juneChallenges/ListNode.java

@@ -0,0 +1,12 @@
+package com.kishan.java.leetcode.juneChallenges;
+
+
+//  Definition for singly-linked list.
+public class ListNode {
+    int val;
+    ListNode next;
+
+    public ListNode(int x) {
+        this.val = x;
+    }
+}

src/main/java/com/kishan/java/leetcode/juneChallenges/deleteNodeLinkedList.java

@@ -0,0 +1,36 @@
+package com.kishan.java.leetcode.juneChallenges;
+
+public class deleteNodeLinkedList {
+
+    public static void printItemsInLinkedList(ListNode node) {
+        while (node != null) {
+            System.out.println(node.val);
+            node = node.next;
+        }
+
+    }
+
+    public static void deleteNode(ListNode node) {
+        node.val = node.next.val;
+        node.next = node.next.next;
+    }
+
+    public static void main(String[] args) {
+        ListNode linkedList3 = new ListNode(9);
+        ListNode linkedList2 = new ListNode(1);
+        linkedList2.next = linkedList3;
+        ListNode linkedList1 = new ListNode(5);
+        linkedList1.next = linkedList2;
+        ListNode head = new ListNode(4);
+        head.next = linkedList1;
+
+        System.out.println("Before Deleting the node");
+        printItemsInLinkedList(head);
+
+        deleteNode(linkedList2);
+        System.out.println("\nAfter Deleting the node");
+        printItemsInLinkedList(head);
+
+
+    }
+}

src/main/scala/com/kishan/scala/leetcode/juneChallenges/ListNode.scala

@@ -0,0 +1,7 @@
+package com.kishan.scala.leetcode.juneChallenges
+
+//Definition for singly-linked list.
+class ListNode(var _x: Int = 0) {
+  var next: ListNode = null
+  var x: Int = _x
+}

src/main/scala/com/kishan/scala/leetcode/juneChallenges/deleteNodeLinkedList.scala

@@ -0,0 +1,51 @@
+package com.kishan.scala.leetcode.juneChallenges
+
+//Delete Node in a Linked List
+
+/*
+* Input: head = [4,5,1,9], node = 5
+* Output: [4,1,9]
+* Explanation: You are given the second node with value 5, the linked list should become 4 -> 1 -> 9 after calling your function.
+*/
+
+/*
+* Input: head = [4,5,1,9], node = 1
+* Output: [4,5,9]
+* Explanation: You are given the third node with value 1, the linked list should become 4 -> 5 -> 9 after calling your function.
+*/
+
+object deleteNodeLinkedList {
+  def main(args: Array[String]): Unit = {
+
+    //Constructing Linked List
+    var linkedList3 = new ListNode(9)
+    var linkedList2 = new ListNode(1)
+    linkedList2.next = linkedList3
+    var linkedList1 = new ListNode(5)
+    linkedList1.next = linkedList2
+    var head = new ListNode(4)
+    head.next = linkedList1
+
+
+    println("Items Before Deleting The Node")
+    printItemInLinkedList(head)
+
+    println("\nItems After Deleting The Node")
+    deleteNode(linkedList1)
+    printItemInLinkedList(head)
+
+  }
+
+  def deleteNode(node: ListNode): Unit = {
+    node.x = node.next.x
+    node.next = node.next.next
+  }
+
+  def printItemInLinkedList(LinkedList: ListNode): Unit = {
+    var ll: ListNode = LinkedList
+    while (ll != null) {
+      println(ll.x)
+      ll = ll.next
+    }
+  }
+}