图解分析
当p_current->val==p_next->val
当p_current->val!=p_next->val :p_current指针向前移动
C实现代码如下:
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* struct ListNode *next;
* };
*/
struct ListNode *deleteDuplicates(struct ListNode *head){
if(head==NULL) return head;
struct ListNode *p_current=head;
struct ListNode *p_next=head->next;
While(p_current!=NULL&&p_next!=NULL){
if(p_current->val==p_next->val)
p_current->next=p_next->next;
else
p_current=p_next;
p_next=p_next->next;
}
return head;
}
LeetCode实现代码