Update solution for problem 876

leetcode/src/876.c

@@ -1,19 +1,19 @@
-/**
+// Function to find the middle node of a linked list
- * Definition for singly-linked list.
+// this contains the edge cases also
- * struct ListNode {
+struct ListNode* middleNode(struct ListNode* head) {
- *     int val;
+    // Check if the list is empty or has only one node
- *     struct ListNode *next;
+    if (head == NULL || head->next == NULL) {
- * };
+        return head;
- */
-
-struct ListNode *middleNode(struct ListNode *head)
-{
-    struct ListNode *fast, *slow;
-    fast = slow = head;
-    while (fast && fast->next)
-    {
-        slow = slow->next;
-        fast = fast->next->next;
     }
-    return slow;
+
-}
+    struct ListNode* fast = head;
+    struct ListNode* slow = head;
+
+    // Use two pointers to find the middle node
+    while (fast != NULL && fast->next != NULL) {
+        fast = fast->next->next; // Move fast pointer two steps
+        slow = slow->next;       // Move slow pointer one step
+    }
+
+    return slow; // Slow will be at the middle node
+}