# 1 解题思想

Leetcode 80. Remove Duplicates from Sorted Array II 重复移除 解题报告这里写链接内容

# 2 原题

Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list.

For example,
Given 1->2->3->3->4->4->5, return 1->2->5.
Given 1->1->1->2->3, return 2->3.

Subscribe to see which companies asked this question

# 3 AC解

/**
* public class ListNode {
*     int val;
*     ListNode next;
*     ListNode(int x) { val = x; }
* }
*
* 移动的时候记得顺序跳过就可以了
*/
public class Solution {
} else{
}
}
}
p.next=null;
}
}

#### leetcode+链表+移除所有的重复项

2018-02-24 22:33:01

#### 【LeetCode】数组系列（去重）

2017-04-30 20:27:28

#### LeetCode基础-链表-删除重复结点

2017-10-28 18:44:07

#### Leetcode 删除重复的链表元素

2013-05-30 10:52:05

#### leetcode 83.Remove Duplicates from Sorted List-链表去重

2015-10-05 23:40:47

#### leetcode：Remove Duplicates from Sorted List（去除链表中重复元素）【面试算法题】

2013-10-20 11:44:54

#### leetcode_链表总结

2017-09-24 17:40:41

#### L2-2. 链表去重

2016-05-12 19:19:43

#### leetcode之83. Remove Duplicates from Sorted List（C++实现 链表去重）

2016-09-14 15:06:20

#### PATL2-002. 链表去重。细心，格式

2017-03-16 18:17:28

## 不良信息举报

Leetcode 82. Remove Duplicates from Sorted List II 移除重复 链表版-2 解题报告