给定一个排序链表,删除所有重复的元素,使得每个元素只出现一次。
示例 1:
输入: 1->1->2
输出: 1->2
示例 2:
输入: 1->1->2->3->3
输出: 1->2->3
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* struct ListNode *next;
* };
*/
struct ListNode* deleteDuplicates(struct ListNode* head)
{
struct ListNode *node;
struct ListNode *p_head;
if(head != NULL)
{
if(head->next != NULL)
{
node = head->next;
p_head = head;
}
else
{
return head;
}
}
while(node != NULL)
{
if(node->val == p_head->val)
{
p_head->next = node->next;
node = p_head->next;
}
else
{
node = node->next;
p_head = p_head->next;
}
}
return head;
}