# 83. Remove Duplicates from Sorted List

## 1.問題

* 如果linked list中的元素出現超過一次, 則list只讓該元素出現一次

![](https://901207480-files.gitbook.io/~/files/v0/b/gitbook-legacy-files/o/assets%2F-LGKoChvN9am4__HCIRK%2F-LNcivxVEXEeloBWtcTW%2F-LNcsysCEIOI-mMIAPKv%2F%E8%9E%A2%E5%B9%95%E5%BF%AB%E7%85%A7%202018-09-30%20%E4%B8%8B%E5%8D%881.11.42.png?alt=media\&token=c719c120-840c-4859-8cbc-fe3f62aa9917)

## 2.想法&#x20;

* 提問:
* function header, parameter
* test input
* 說明想法&#x20;
  * **一邊移動一邊移除node:**
    * Create一個dummy node, 初始狀態下\*pre指向這個node, newNode->next = head, 這樣無論是要移除哪個node等同於從list中間移除node
    * pre->next = curr->next
    * curr->next = NULL
    * pre = pre->next
* 測試計算複雜度

## 3.程式碼

```
/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode* deleteDuplicates(ListNode* head) {
        ListNode* tmp = new ListNode(0);
        ListNode* curr = head;
        ListNode* pre = tmp;
        pre->next = curr;
        while (curr && curr->next) {
            if (curr->val == curr->next->val) {
                pre->next = curr->next;
                curr->next = NULL;
                curr = pre->next;
            } else {
                pre = curr;
                curr = curr->next;
            }
        }
        
        return tmp->next;
    }
};
```


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://jenhsuan.gitbook.io/algorithm/leetcode/83.-remove-duplicates-from-sorted-list.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.
