题解 | #牛群排列去重#

/**
 * 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
          ListNode*cur = head;
          set<int>nums;
          while(cur){
               nums.insert(cur->val);
              cur = cur->next;
          }
          ListNode*Head = nullptr;
          ListNode*tail = nullptr;
          for(auto x:nums){
              ListNode*newNode =  new ListNode(x);
              if(tail==nullptr){
                  Head = newNode;
                  tail = newNode;
              }
              else{
                  tail->next = newNode;
                   tail = newNode;
              }
          }
          return Head;
    }
};