leetcode

0 class Solution {

1 public:

2 ListNode *mergeNodes(ListNode *head) {

3 if (!head) return nullptr;

4 for (ListNode *p = head; p->next->next;)

5 if (p->val == 0 && p->next->val != 0 && p->next->next->val != 0) {

6 p->next->next->val += p->next->val;

7 p->next = p->next->next;

8 } else

9 p = p->next;

10

11 for (ListNode *p = head; p->next;)

12 if (!p->next->val)

13 p->next = p->next->next;

14 else

15 p = p->next;

16

17 return head->val ? head : head->next;

18 }

19 };