Skip to content

Create 2181. Merge Nodes in Between Zeros #521

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
Jul 4, 2024
Merged
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
21 changes: 21 additions & 0 deletions 2181. Merge Nodes in Between Zeros
Original file line number Diff line number Diff line change
@@ -0,0 +1,21 @@
class Solution {
public:
ListNode* mergeNodes(ListNode* head){
//BASE CASE -> if we have a single zero, simply return null
if(!head->next) return nullptr;

//fetch sum from current 0 to next 0
ListNode* ptr= head->next;
int sum=0;
while(ptr->val!=0) sum+= ptr->val, ptr=ptr->next;

//assign sum on the first node between nodes having value 0.
head->next->val= sum;

//call and get the answer and connect the answer to next of head->next
head->next->next= mergeNodes(ptr);

//return head->next..=> new head
return head->next;
}
};
Loading