Modified SwapNodes(int , int) method

funCodeSonali · funCodeSonali · commit 5d44004ace9e · 2022-04-03T10:19:01.000+05:30
diff --git a/src/main/java/com/thealgorithms/datastructures/lists/SinglyLinkedList.java b/src/main/java/com/thealgorithms/datastructures/lists/SinglyLinkedList.java
@@ -263,9 +263,12 @@ public void insertNth(int data, int position) {
     public void swapNodes(int a, int b) {
         Node currentNode = head;
         Node prev_a , prev_b , a_node , b_node;
-        while(currentNode.next.value!=a&&currentNode.next.value!=b){
+        while(currentNode.next!=null&&currentNode.next.value!=a&&currentNode.next.value!=b){
             currentNode = currentNode.next;
         }
+        if(currentNode.next==null){
+            return;
+        }
         if(currentNode.next.value==a){
             prev_a = currentNode;
             a_node = currentNode.next;
