83.删除排序链表中的重复元素个人解法

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     struct ListNode *next;
 * };
 */


struct ListNode* deleteDuplicates(struct ListNode* head){
    if (head == NULL || head->next == NULL)  return head; // 如果链表为空，直接返回头节点
    struct ListNode *p1 = head->next;
    struct ListNode *p2 = head;
    while(p1 != NULL) {
        if (p2->val == p1->val) {
            p2->next = p1->next;
            p1 = p1->next;
        }
        else {
            p1 = p1->next;
            p2 = p2->next;
        }
    }
    return head;
}