Given a sorted linked list, delete all duplicates such that each element appear only once.
public class Solution {
public ListNode deleteDuplicates(ListNode head) {
/**
* 去除链表中的重复元素
* 与去除数组中的重复元素很像
* 基本思路都是:拿前一个数与后一个数比较,相同就把后一个数丢掉
*/
if (head != null) {
//now为当前位置
ListNode now = head;
while (now.next != null) {
if (now.val == now.next.val) {
now.next = now.next.next;
} else {
now = now.next;
}
}
}
return head;
}
}