-
Notifications
You must be signed in to change notification settings - Fork 0
/
2181. 合并零之间的节点.cpp
38 lines (34 loc) · 974 Bytes
/
2181. 合并零之间的节点.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
/**
* 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* ans = new ListNode(-1);
ListNode* x = ans;
ListNode* temp = head;
while(temp!=NULL){
if(temp->val==0){
ListNode* temp2 = temp2->next;
int sum = 0;
while(temp2!=NULL && temp2->val!=0){
sum += temp2->val;
temp2 = temp2->next;
}
temp = temp2;
if(temp2!=NULL){
x ->next = new ListNode(sum);
x = x->next;
}
}
}
return ans->next;
}
};