Update 4th July code

Author: SartHak-0-Sach

186-4th_July-Merge_nodes_in_bw_zeroes/approach-explanation.txt

@@ -0,0 +1,24 @@
+Intuition
+This function processes a linked list where segments between consecutive zeroes are summed into new nodes. It starts iterating from the second node (head->next) to skip the initial zero. As it traverses, it accumulates values (c) until it encounters a zero, then creates a new node with the accumulated sum. The resulting linked list consists of these summed nodes, effectively merging segments of nodes between zeroes into single nodes with their aggregated values.
+
+Approach
+Initialization:
+temp starts at head->next to skip the initial zero.
+ans is a new dummy node to construct the result list.
+tempAns points to the dummy node, used to build the result list.
+c is a counter to sum the values between zeroes.
+Traversal and Summation:
+Traverse the linked list using temp.
+If temp is not zero, add its value to c.
+If temp is zero, create a new node with the value c and add it to the result list. Then, reset c to zero.
+Construction of the Result List:
+For each segment of values between zeroes, create a new node and link it to the result list.
+Continue this until the end of the original list.
+The result list is built starting from ans->next to skip the dummy node.
+
+Complexity
+Time complexity:
+O(n)
+
+Space complexity:
+O(1)

186-4th_July-Merge_nodes_in_bw_zeroes/code.cpp

@@ -0,0 +1,41 @@
+#include <iostream>
+#include <vector>
+#include <algorithm>
+using namespace std;
+
+struct ListNode
+{
+    int val;
+    ListNode *next;
+    ListNode() : val(0), next(nullptr){} 
+    ListNode(int x) : val(x), next(nullptr){} 
+    ListNode(int x, ListNode *next) : val(x), next(next){}
+};
+
+class Solution
+{
+public:
+    ListNode *mergeNodes(ListNode *head)
+    {
+        ListNode *temp = head->next;
+        ListNode *ans = new ListNode(-1);
+        ListNode *tempAns = ans;
+        int c = 0;
+        while (temp)
+        {
+            if (temp and temp->val != 0)
+            {
+                c += temp->val;
+            }
+            else if (temp and temp->val == 0)
+            {
+                ListNode *t = new ListNode(c);
+                tempAns->next = t;
+                tempAns = tempAns->next;
+                c = 0;
+            }
+            temp = temp->next;
+        }
+        return ans->next;
+    }
+};