Given a Singly Linked List. The task is to check if the absolute difference between the consecutive nodes in the linked list is 1 or not.
Examples:
Input : List = 2->3->4->5->4->3->2->1->NULL
Output : YES
Explanation : The difference between adjacent nodes in the list is 1. Hence the given list is a Jumper Sequence.Input : List = 2->3->4->5->3->4->NULL
Output : NO
Simple Approach:
- Take a temporary pointer to traverse the list.
- Initialize a flag variable to true which indicates that the absolute difference of consecutive nodes is 1.
- Start traversing the list.
- Check if the absolute difference of consecutive nodes is 1 or not.
- If Yes then continue traversal otherwise update flag variable to zero and stop traversing any further.
Return flag.
Below is the implementation of the above approach:
C++
// C++ program to check if absolute difference // of consecutive nodes is 1 in Linked List #include <bits/stdc++.h> using namespace std; // A linked list node struct Node { int data; struct Node* next; }; // Utility function to create a new Node Node* newNode(int data) { Node* temp = new Node; temp->data = data; temp->next = NULL; return temp; } // Function to check if absolute difference // of consecutive nodes is 1 in Linked List bool isConsecutiveNodes(Node* head) { // Create a temporary pointer // to traverse the list Node* temp = head; // Initialize a flag variable int f = 1; // Traverse through all the nodes // in the list while (temp) { if (!temp->next) break; // count the number of jumper sequence if (abs((temp->data) - (temp->next->data)) != 1) { f = 0; break; } temp = temp->next; } // return flag return f; } // Driver code int main() { // creating the linked list Node* head = newNode(2); head->next = newNode(3); head->next->next = newNode(4); head->next->next->next = newNode(5); head->next->next->next->next = newNode(4); head->next->next->next->next->next = newNode(3); head->next->next->next->next->next->next = newNode(2); head->next->next->next->next->next->next->next = newNode(1); if (isConsecutiveNodes(head)) cout << "YES"; else cout << "NO"; return 0; } |
chevron_right
filter_none
Java
// Java program to check if absolute difference // of consecutive nodes is 1 in Linked List class GFG { // A linked list node static class Node { int data; Node next; }; // Utility function to create a new Node static Node newNode(int data) { Node temp = new Node(); temp.data = data; temp.next = null; return temp; } // Function to check if absolute difference // of consecutive nodes is 1 in Linked List static int isConsecutiveNodes(Node head) { // Create a temporary pointer // to traverse the list Node temp = head; // Initialize a flag variable int f = 1; // Traverse through all the nodes // in the list while (temp != null) { if (temp.next == null) break; // count the number of jumper sequence if (Math.abs((temp.data) - (temp.next.data)) != 1) { f = 0; break; } temp = temp.next; } // return flag return f; } // Driver code public static void main(String[] args) { // creating the linked list Node head = newNode(2); head.next = newNode(3); head.next.next = newNode(4); head.next.next.next = newNode(5); head.next.next.next.next = newNode(4); head.next.next.next.next.next = newNode(3); head.next.next.next.next.next.next = newNode(2); head.next.next.next.next.next.next.next = newNode(1); if (isConsecutiveNodes(head) == 1) System.out.println("YES"); else System.out.println("NO"); } } // This code has been contributed by 29AjayKumar |
chevron_right
filter_none
Python3
# Python3 program to check if absolute difference # of consecutive nodes is 1 in Linked List import math # A linked list node class Node: def __init__(self, data): self.data = data self.next = None # Utility function to create a new Node def newNode(data): temp = Node(data) temp.data = data temp.next = None return temp # Function to check if absolute difference # of consecutive nodes is 1 in Linked List def isConsecutiveNodes(head): # Create a temporary pointer # to traverse the list temp = head # Initialize a flag variable f = 1 # Traverse through all the nodes # in the list while (temp): if (temp.next == None): break # count the number of jumper sequence if (abs((temp.data) - (temp.next.data)) != 1) : f = 0 break temp = temp.next # return flag return f # Driver code if __name__=='__main__': # creating the linked list head = newNode(2) head.next = newNode(3) head.next.next = newNode(4) head.next.next.next = newNode(5) head.next.next.next.next = newNode(4) head.next.next.next.next.next = newNode(3) head.next.next.next.next.next.next = newNode(2) head.next.next.next.next.next.next.next = newNode(1) if (isConsecutiveNodes(head)): print("YES") else: print("NO") # This code is contributed by Srathore |
chevron_right
filter_none
C#
// C# program to check if absolute difference // of consecutive nodes is 1 in Linked List using System; public class GFG { // A linked list node public class Node { public int data; public Node next; }; // Utility function to create a new Node static Node newNode(int data) { Node temp = new Node(); temp.data = data; temp.next = null; return temp; } // Function to check if absolute difference // of consecutive nodes is 1 in Linked List static int isConsecutiveNodes(Node head) { // Create a temporary pointer // to traverse the list Node temp = head; // Initialize a flag variable int f = 1; // Traverse through all the nodes // in the list while (temp != null) { if (temp.next == null) break; // count the number of jumper sequence if (Math.Abs((temp.data) - (temp.next.data)) != 1) { f = 0; break; } temp = temp.next; } // return flag return f; } // Driver code public static void Main(String[] args) { // creating the linked list Node head = newNode(2); head.next = newNode(3); head.next.next = newNode(4); head.next.next.next = newNode(5); head.next.next.next.next = newNode(4); head.next.next.next.next.next = newNode(3); head.next.next.next.next.next.next = newNode(2); head.next.next.next.next.next.next.next = newNode(1); if (isConsecutiveNodes(head) == 1) Console.WriteLine("YES"); else Console.WriteLine("NO"); } } // This code contributed by Rajput-Ji |
chevron_right
filter_none
Output:
YES
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
Recommended Posts:
- Maximum sum of K consecutive nodes in the given Linked List
- Find the string formed by joining k consecutive nodes of linked list
- Delete N nodes after M nodes of a linked list
- Append odd position nodes in reverse at the end of even positioned nodes in a Linked List
- Splitting starting N nodes into new Circular Linked List while preserving the old nodes
- Check if a linked list is Circular Linked List
- Difference between Singly linked list and Doubly linked list
- Construct a Maximum Sum Linked List out of two Sorted Linked Lists having some Common nodes
- Absolute Difference of all pairwise consecutive elements in an array
- Sort linked list which is already sorted on absolute values
- Absolute distinct count in a Linked List
- XOR Linked List - A Memory Efficient Doubly Linked List | Set 1
- XOR Linked List – A Memory Efficient Doubly Linked List | Set 2
- Merge a linked list into another linked list at alternate positions
- Convert singly linked list into circular linked list
- Convert Singly Linked List to XOR Linked List
- Create new linked list from two given linked list with greater element at each node
- Delete alternate nodes of a Linked List
- Reverse alternate K nodes in a Singly Linked List
- Segregate even and odd nodes in a Linked List
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.
