给你一个链表的头节点 head 和一个整数 val ,请你删除链表中所有满足 Node.val == val 的节点,并返回 新的头节点 。
示例 1:
输入:head = [1,2,6,3,4,5,6], val = 6
输出:[1,2,3,4,5]
示例 2:
输入:head = [], val = 1
输出:[]
示例 3:
输入:head = [7,7,7,7], val = 7
输出:[]
提示:
列表中的节点数目在范围 [0, 104] 内
1 <= Node.val <= 50
0 <= val <= 50
来源:力扣(LeetCode)
链接:https://leetcode.cn/problems/remove-linked-list-elements
我的:
struct ListNode* removeElements(struct ListNode* head, int val){
struct ListNode *p,*pr;
if(head == NULL){
return head;
}
while(head->val == val){
if(head->next == NULL){
return NULL;
}
head = head->next;
}
p = head;
pr = p->next;
while(pr){
if(pr->val == val){
if(pr->next == NULL){
p->next = NULL;
}
else{
p->next = pr->next;
}
}
else{
p = p->next;
}
pr = p->next;
}
return head;
}
官方:
struct ListNode* removeElements(struct ListNode* head, int val) {
struct ListNode* dummyHead = malloc(sizeof(struct ListNode));
dummyHead->next = head;
struct ListNode* temp = dummyHead;
while (temp->next != NULL) {
if (temp->next->val == val) {
temp->next = temp->next->next;
} else {
temp = temp->next;
}
}
return dummyHead->next;
}