LeetCode 2181 : Merge Nodes in Between Zeros
Рет қаралды 954
4 ай бұрын🟡 Get 1 to 1 coaching with me: topmate.io/engineeringdigest
🟡 Donate: paypal.me/engineeringdigest
🟡 Perks: www.youtube.com/@EngineeringD...
🔴 Discord: / discord
🔴 Twitch: / engineeringdigest
🔴 Personal KZfaq Channel: / @thevipulvats
🔴 Instagram: / thevipulvats
🔴 Twitter: / thevipulvats
🔴 LinkedIn: / thevipulvats
🔴 Website: engineeringdigest.net
🟢 Description:
@aaaappppsjhd Ай бұрын
nice explanation bro
@a-55omkarnilawar16 Ай бұрын
/** * Definition for singly-linked list. * 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* prev = head; ListNode* nexti = head->next; int count = 0; while(nexti != nullptr) { if(nexti->val != 0) { count += nexti->val; } if(nexti->val == 0) { prev->next->val = count; count = 0; prev->next->next = nexti->next; prev = nexti; } nexti = nexti->next; } return head->next; } };
@rohitpachauri2372 2 ай бұрын
thnx
Aryan Mittal
Рет қаралды 1,4 М.
PADLOTOON
Рет қаралды 34 МЛН
codestorywithMIK
Рет қаралды 4,3 М.
Skillsiya
Рет қаралды 283 М.
Coding with John
Рет қаралды 67 М.
shashCode
Рет қаралды 1,3 М.