class Solution { public: void deleteNode(ListNode* node) { if(node == nullptr) return; while(node -> next != nullptr && node -> next -> next != nullptr){ node -> val = node -> next -> val; node = node -> next; } node -> val = node -> next -> val; node -> next = nullptr; } };
版权声明:本文为博主原创文章,未经博主允许不得转载。
原文地址:http://blog.csdn.net/ny_mg/article/details/46943877