题目
思路
- 又是一道智商题
代码
public ListNode deleteDuplicates(ListNode head) {
//返回pre.next.next即可
ListNode new_node = new ListNode();
ListNode pre = new ListNode(101,new_node);
//当前存的数字
int val = 101;
while(head!=null){
if(head.val!=val){
new_node.next = new ListNode(head.val);
val=head.val;
head=head.next;
new_node=new_node.next;
}else head = head.next;
}
return pre.next.next;
}