> For the complete documentation index, see [llms.txt](https://wentao-shao.gitbook.io/leetcode/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://wentao-shao.gitbook.io/leetcode/linked-list/83.remove-duplicates-from-sorted-list.md).

# 83.Remove-Duplicates-from-Sorted-List

## 83. Remove Duplicates from Sorted List

## 题目地址

<https://leetcode.com/problems/remove-duplicates-from-sorted-list/>

<https://www.lintcode.com/problem/remove-duplicates-from-sorted-list/description>

## 题目描述

```
Given a sorted linked list, delete all duplicates such that each element appear only once.

Example 1:
Input: 1->1->2
Output: 1->2

Example 2:
Input: 1->1->2->3->3
Output: 1->2->3
```

## 代码

### Approach 1: Straight-Forward Approach

```java
public class Solution {
    public ListNode deleteDuplicates(ListNode head) {
    ListNode curr = head;
    while (curr != null) {
      while (curr.next != null && curr.val == curr.next.val){
        curr.next = curr.next.next;
      }
      curr = curr.next;
    }
    return head;
  }
}
```