Count Nodes of Linked List

Count Nodes of Linked List

Problem Statement

Given a singly linked list. The task is to find the length of the linked list, where length is defined as the number of nodes in the linked list

Example 1

Input :
LinkedList: 1->2->3->4->5

Output : 5

Explanation : 
Count of nodes in the linked list is 5, which is its length.

Example 2

Input :
LinkedList: 2->4->6->7->5->1->0

Output : 7

Explanation : Count of nodes in the linked list is 7. Hence, the output is 7.

Task

Your task is to complete the given function getCount(), which takes a head reference as an argument and should return the length of the linked list.

Expected Time Complexity : O(N)
Expected Auxiliary Space : O(1)

Constraints :
1 <= N <= 10⁵
1 <= value <= 10³

Solutions

Java Solution

class Solution
{
    //Function to count nodes of a linked list.
    public static int getCount(Node head)
    {
        int count = 0;
        Node currentNode = head;
        while(currentNode != null) {
            count++;
            currentNode = currentNode.next;
        }
        return count;
    }
}     
    

C++ Solution

class Solution
{
    public:
    //Function to count nodes of a linked list.
    int getCount(struct Node* head) {
        Node * temp = head;
        int count = 0;
        while(temp != NULL) {
            temp = temp->next;
            count++;
        }
        return count;
    }
};