Remove Duplicates from Sorted List -LeetCode

Given a sorted linked list, delete all duplicates such that each element appear only once.

For example,
Given 1->1->2, return 1->2.
Given 1->1->2->3->3, return 1->2->3.

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode *deleteDuplicates(ListNode *head) {
        ListNode *p = head;
	    map <int, int> m;
	    map <int, int>::iterator l_it;
	    if (p == NULL || p->next == NULL)
	    {
		    return head;
	    }
	    m[p->val] = 1;
	    while(p->next)
	    {
		    l_it = m.find(p->next->val);
		    if(l_it == m.end())
	    	{
			    m[p->next->val] = 1;
			    p = p->next;
		    }
		    else
		    {
			    p->next = p->next->next;
		    }
	    }
	    return head;
    }
};