203 LeetCode 移除链表元素 《C语言和C++代码》

删除链表中等于给定值 val 的所有节点。

示例:

输入: 1->2->6->3->4->5->6, val = 6
输出: 1->2->3->4->5

下面是完整代码;
C语言

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *    int val;
 *    struct ListNode *next;
 * };
 */
struct ListNode* removeElements(struct ListNode* head, int val) {
		    struct ListNode* cur = head;   
		    struct ListNode* next;  
		    struct ListNode* prev = NULL;  
    while(cur)
    {
	        if(cur->val == val)
	        {
		            next = cur->next;
		            free(cur);
		            cur = next;
		            if(prev == NULL)
		            {
		                 head = next;
		            }
		            else
		            {
		                    prev->next = next;
		            }
           }
           else
           {
              	 prev = cur;   //这里写反了，不可以写反，因为prev找不到cur了；
             	 cur = cur->next;
           }
     }
          return head;
 }

下面是C++语言代码：

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *    int val;
 *    ListNode *next;
 *    ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode* removeElements(ListNode* head, int val) {
        if(head == NULL)
        {
            return head;
        }
        ListNode* p = head;
        ListNode* q = head->next;
        while(q)
        {
            if(q->val == val)
            {
                p->next = q->next;
                q = q->next;
            }
            else
            {
                p = p->next;        
                q = q->next;

            }
        }
        if(head->val == val)
        {
            head = head->next;
        }
        return head;
    }
};