题目描述
题目难度:Easy
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
AC代码
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
class Solution {
public ListNode deleteDuplicates(ListNode head) {
if(head == null || head.next == null) return head;
ListNode newHead = head, pre = head;
while(head != null){
while(head.next != null && head.val == head.next.val) head = head.next;
head = head.next;
pre.next = head;
pre = pre.next;
}
return newHead;
}
}