删除链表中的元素

 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     /**
12      * @param head a ListNode
13      * @param val an integer
14      * @return a ListNode
15      */
16     ListNode *removeElements(ListNode *head, int val) {
17         // Write your code here
18         //meiyou ya ba jie dian!!!???  自己加一个表头
19         //static int cnt = 0;
20         //kong biao!!就不是问题了。
21         ListNode *temp=new ListNode(0);
22         temp->next= head;
23         head=temp;
24         
25         while(head->next != NULL){
26             if(head->next->val == val){
27                 head->next = head->next->next;
28             }else{
29                 head = head->next;
30             }
31         }
32         return temp->next;
33 
34     }
35 };