题解 | 删除有序链表中重复的元素-I

# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None
#
# 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
#
# 
# @param head ListNode类 
# @return ListNode类
#
class Solution:
    def deleteDuplicates(self , head: ListNode) -> ListNode:
        # write code here
        if head == None or head.next == None:
            return head
        data = head
        while data != None:
            temp = data.next
            while temp !=None:
                if temp.val != data.val:
                    temp = temp.next
                else:
                    data.next = temp.next
                    temp.next = None
                    temp = data.next
            data = data.next
        return head
                

对应的c语言代码如下：

/**

 * struct ListNode {

 *  int val;

 *  struct ListNode *next;

 * };

 */

/**

 * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可

 *

 *

 * @param head ListNode类

 * @return ListNode类

 */

struct ListNode* deleteDuplicates(struct ListNode* head ) {

    // write code here

    struct ListNode* node = head;

    struct ListNode* node_second = node;

    while (NULL != node) {

        node_second = node->next;

        while (NULL != node_second) {

            if (node_second->val == node->val) {

                node->next = node_second->next;

                node_second->next = NULL;

                node_second = node->next;

            } else {

                node_second = node_second->next;

            }

        }

        node = node->next;

    }

    return head;

}