LeetCode-203

yinda_peng

203. Remove Linked List Elements    (easy)

Given the head of a linked list and an integer val, remove all the nodes of the linked list that has Node.val == val, and return the new head.


Example 1:
Input: head = [1,2,6,3,4,5,6], val = 6
Output: [1,2,3,4,5]
Example 2:
Input: head = [], val = 1
Output: []
Example 3:
Input: head = [7,7,7,7], val = 7
Output: []


My Code:

1. /**
   
2. * Definition for singly-linked list.
   
3. * struct ListNode {
   
4. *     int val;
   
5. *     struct ListNode *next;
   
6. * };
   
7. */
   
8. 
   
9. 
   
10. struct ListNode* removeElements(struct ListNode* head, int val){
    
11.     struct ListNode* Head = malloc(sizeof(struct ListNode));
    
12.     Head->next = head;
    
13.     struct ListNode* temp = Head;
    
14. 
    
15.     while (temp->next != NULL)
    
16.     {
    
17.         if (temp->next->val != val)
    
18.         {temp = temp->next;}
    
19.         else
    
20.         {
    
21.             temp->next = temp->next->next;
    
22.         }
    
23.     }
    
24.     return Head->next;
    
25. }

复制代码

Time: 8 ms                      beat:97.16%
Memory: 7.7MB              beat:92.71%