leetcode 203. Remove Linked List Elements

最新推荐文章于 2024-11-04 16:26:24 发布

weixin_34150830

最新推荐文章于 2024-11-04 16:26:24 发布

阅读量53

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/njczy2010/p/5477499.html

本文介绍了如何使用C++删除单链表中指定值的节点，包括定义链表节点结构，实现删除操作，并通过示例代码展示解决方案。

传送门

203. Remove Linked List Elements

My Submissions

QuestionEditorial Solution

Total Accepted: 62648 Total Submissions: 217789 Difficulty: Easy

Remove all elements from a linked list of integers that have value val.

Example
Given: 1 --> 2 --> 6 --> 3 --> 4 --> 5 --> 6, val = 6
Return: 1 --> 2 --> 3 --> 4 --> 5

Credits:
Special thanks to @mithmatt for adding this problem and creating all test cases.

Subscribe to see which companies asked this question

Hide Tags

Linked List

Show Similar Problems

题解：

转自：

https://yq.aliyun.com/articles/3506

Submission Details

63 / 63 test cases passed.	Status: Accepted
Runtime: 32 ms

 1 /**
 2  * Definition for singly-linked list.
 3  * struct ListNode {
 4  *     int val;
 5  *     ListNode *next;
 6  *     ListNode(int x) : val(x), next(NULL) {}
 7  * };
 8  */
 9 class Solution {
10 public:
11     ListNode* removeElements(ListNode* head, int val) {
12         ListNode* dummy = new ListNode(0);  
13         dummy->next = head;  
14         ListNode *p = dummy;  
15         ListNode *q = head;  
16         while(q != NULL) {  
17             if(q->val == val) {  
18                 p->next = q->next;  
19                 free(q);
20             } 
21             else {  
22                 p = p->next;  
23             }  
24             q = q->next;  
25         }  
26         return dummy->next;  
27     }
28 };