题解 | #牛群排列去重#

/**
 * struct ListNode {
 *  int val;
 *  struct ListNode *next;
 *  ListNode(int x) : val(x), next(nullptr) {}
 * };
 */
class Solution {
  public:
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     *
     * @param head ListNode类
     * @return ListNode类
     */
    ListNode* deleteDuplicates(ListNode* head) {
        // write code here
        if (head != nullptr) {
            ListNode* cur = head;
            while (cur->next != nullptr) {
                // std::cout<<cur->val<<" "<<cur->next->val<<std::endl;
                if (cur->next->val == cur->val) {
                    cur->next = cur->next->next;
                } else {
                    cur = cur->next;
                }
            }
        }


        return head;
    }
};