Given the
head
of a sorted linked list, delete all duplicates such that each element appears only once. Return the linked list sorted as well.存在一个按升序排列的链表,给你这个链表的头节点
head
,请你删除所有重复的元素,使每个元素 只出现一次 。返回同样按升序排列的结果链表。
Example 1:
Input: head = [1,1,2] Output: [1,2]Example 2:
Input: head = [1,1,2,3,3] Output: [1,2,3]Constraints:
- The number of nodes in the list is in the range
[0, 300]
.-100 <= Node.val <= 100
- The list is guaranteed to be sorted in ascending order.
这题不是很难,遍历一下就行,我这个代码有一个问题,就是循环里面不能省略else,不然会有空指针异常,不知道为啥。
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode() {}
* ListNode(int val) { this.val = val; }
* ListNode(int val, ListNode next) { this.val = val; this.next = next; }
* }
*/
class Solution {
public ListNode deleteDuplicates(ListNode head) {
if(head == null) return head;
ListNode prev = head;
while(prev.next != null){
if(prev.val == prev.next.val){
prev.next = prev.next.next;
} else {
prev = prev.next;
}
}
return head;
}
}
复杂度分析
-
时间复杂度:O(n)O(n),其中 nn 是链表的长度。
-
空间复杂度:O(1)O(1)