筛选链表(c++实现)

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
    bool st[10010];
public:
    ListNode* filterList(ListNode* head) {
        st[abs(head->val)] = true;
        for(auto p = head;p->next;){
            auto n = p->next;
            if(st[abs(n->val)]){
                p->next = n->next;
                delete n;
            }else{
                st[abs(n->val)] = true;
                p = p->next;
            }
        }
        return head;
    }
};