题目:
Given a sorted linked list, delete all duplicates such that each element appear only once.
For example,
Given 1->1->2
, return 1->2
.
Given 1->1->2->3->3
, return 1->2->3
题解:
没啥好说的,这个得遍历一遍吧。定义两个点,pre和cur,顾名思义,不多解释。我运行几次时间都在400ms+,挺慢的,不知道啥情况。
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
public class Solution {
public ListNode deleteDuplicates(ListNode head) {
if(head==null||head.next==null)return head;
ListNode pre=head;
ListNode cur=pre.next;
while(cur!=null){
if(cur.val==pre.val){
pre.next=cur.next;
}
else{
pre=cur;
}
cur=cur.next;
}
return head;
}
}