题解 | #单链表的排序#

冒泡！

 * struct ListNode {
 *	int val;
 *	struct ListNode *next;
 * };
 *
 * C语言声明定义全局变量请加上static，防止重复定义
 */
/**
 * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
 *
 * 
 * @param head ListNode类 
 * @return ListNode类
 */
struct ListNode* deleteDuplicates(struct ListNode* head ) {
    // write code here
    struct ListNode* p0;
    struct ListNode* p1;
    struct ListNode* p2;
    struct ListNode* phead;
    int temp;
    p0 = head;
    phead = head;
    if(head==NULL || head->next==NULL)
    {
        return head;
    }
    temp = p0->val;
    p1 = p0->next;
    while(p1!=NULL)
    {
        p2 = p1->next;
        if(p1->val == temp)
        {
            
            p1->next = NULL;
            if(temp == head->val)
            {
                head = p2;
                phead = head;
                p0 = phead;
                p1 = p2;
            }
            else
            {
                phead->next = p2;
                p0 = phead;
                p1 = p2;
            }
        }
        else
        {
            temp = p1->val;
            phead = p0;
            p0 = p1;
            p1 = p2;    
        }
    }
    return head;
}