題目:
出處:LeetCode 237.
思路:
- 移動刪除後面的節點,刪除最後一個結點。
代碼一:
class Solution {
public:
void deleteNode(ListNode* node) {
while(node->next->next)
{
node->val = node->next->val;
node = node -> next;
}
node->val = node->next->val;
delete(node->next);
node->next = NULL;
}
};
代碼二:
class Solution {
public:
void deleteNode(ListNode* node) {
if(node->next)
{
node->val = node->next->val;
}
node->next = node->next->next;
}
};