Shulou(Shulou.com)06/02 Report--

This article mainly shows you "LeetCode how to delete all the elements specified in the linked list", the content is easy to understand, well-organized, hope to help you solve your doubts, the following let the editor lead you to study and learn "LeetCode how to delete all the elements specified in the linked list" this article.

Deletes all elements specified in the linked list.

1) when deleting a linked list node, the memory of the node should be released in time to avoid memory leakage.

2) if the node value is consistent with the given value, delete it and assign the next node to * list; otherwise, you can take the next node.

/ * Definition for singly-linked list. * struct ListNode {* int val; * struct ListNode* next; *}; * / struct ListNode* removeElements (struct ListNode* head, int val) {if (head = = NULL) {return head;} struct ListNode* * list = & head; while (* list) {if ((* list)-> val = = val) {struct ListNode* delete = * list * list = (* list)-> next; free (delete);} else {list = & (* list)-> next;}} return head;} above is all the content of the article "how to delete all the elements specified in the linked list". Thank you for reading! I believe we all have a certain understanding, hope to share the content to help you, if you want to learn more knowledge, welcome to follow the industry information channel!

Welcome to subscribe "Shulou Technology Information " to get latest news, interesting things and hot topics in the IT industry, and controls the hottest and latest Internet news, technology news and IT industry trends.