#include <leetcode.h>
◆ mergeNodes()
ListNode * leetcode::merge_nodes_in_between_zeros::Solution::mergeNodes |
( |
ListNode * | head | ) |
|
|
static |
在文件 leetcode.cpp 第 3192 行定义.
3192 {
3193 while(head != nullptr && head->val == 0) {
3194 head = head->next;
3195 }
3196 auto *prev = head;
3197 while(head != nullptr && head->next != nullptr) {
3198 if(head->next->val != 0) {
3199 head->val += head->next->val;
3200 head->next = head->next->next;
3201 } else {
3202 head->next = head->next->next;
3203 head = head->next;
3204 }
3205 }
3206 return prev;
3207 }
引用了 leetcode::ListNode::next , 以及 leetcode::ListNode::val.
该类的文档由以下文件生成: