題解 | #刪除鏈表的節(jié)點(diǎn)#
刪除鏈表的節(jié)點(diǎn)
http://fangfengwang8.cn/practice/f9f78ca89ad643c99701a7142bd59f5d
/**
- struct ListNode {
- int val;
- struct ListNode *next;
- ListNode(int x) : val(x), next(nullptr) {}
- };
/
class Solution {
public:
/*
- 代碼中的類名、方法名、參數(shù)名已經(jīng)指定，請勿修改，直接返回方法規(guī)定的值即可
- @param head ListNode類
- @param val int整型
- @return ListNode類 / ListNode deleteNode(ListNode* head, int val) { // write code here ListNode* last = head->next; ListNode* front = head; if(head->val == val) return head->next; while(last != nullptr) { if(last->val == val) { front->next = last->next; } last = last->next; front = front->next; } return head; } };
湯臣倍健開獎(jiǎng)49人在聊
