ListNode *removeElements(ListNode *head, int val) {
while ( head != NULL && head->val == val){
head = head->next;
}
if ( head == NULL) {
return NULL;
}
ListNode *ppp = head;
ListNode *d = head->next;
while( d != NULL) {
if ( d->val == val) {
ppp->next = d->next;
} else {
ppp = d;
}
d = d->next;
}
return head;
}
};
while ( head != NULL && head->val == val){
head = head->next;
}
if ( head == NULL) {
return NULL;
}
ListNode *ppp = head;
ListNode *d = head->next;
while( d != NULL) {
if ( d->val == val) {
ppp->next = d->next;
} else {
ppp = d;
}
d = d->next;
}
return head;
}
};
解题思路:照老师课件,