/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode* deleteNode(ListNode* head, int val) {
ListNode* ans;
ans = head;
if(head->val==val) return head->next;
while(head->next != NULL){
if(head->next->val==val){
head->next = head->next->next;
if(head->next == NULL) break;
}
head = head->next;
}
return ans;
}
};
链表,每次一遇到都有点手生,原理很简单,语法还要练
注意要存好head