Mar 18, 2021
1 min read
[LeetCode]83. Remove Duplicates from Sorted List(Easy)
Description:
Given the
headof a sorted linked list, delete all duplicates such that each element appears only once. Return the linked list sorted as well.
Example 1:
Input: head = [1,1,2,3,3]
Output: [1,2,3]Solution 1:
Time complexity O(N). We would need both prev and curNode. If prev’s value is equivalent to curNode’s value, set prev.next to curNode.next. Otherwise, move prev to prev.next.
