1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
| class Solution {
public ListNode mergeNodes(ListNode head) {
ListNode pre = null;
ListNode curr = head;
while (curr != null && curr.next != null) {
while (curr.next != null) {
if (curr.next.val == 0) {
pre = curr;
curr = curr.next;
break;
} else {
curr.val += curr.next.val;
curr.next = curr.next.next;
}
}
}
pre.next = null;
return head;
}
}
|
References
2181. Merge Nodes in Between Zeros