2022-03-27 20:56:26 +08:00
< p > Given the < code > head< / code > of a sorted linked list, < em > delete all duplicates such that each element appears only once< / em > . Return < em > the linked list < strong > sorted< / strong > as well< / em > .< / p >
< p > < / p >
2023-12-09 18:42:21 +08:00
< p > < strong class = "example" > Example 1:< / strong > < / p >
2022-03-27 20:56:26 +08:00
< img alt = "" src = "https://assets.leetcode.com/uploads/2021/01/04/list1.jpg" style = "width: 302px; height: 242px;" / >
< pre >
< strong > Input:< / strong > head = [1,1,2]
< strong > Output:< / strong > [1,2]
< / pre >
2023-12-09 18:42:21 +08:00
< p > < strong class = "example" > Example 2:< / strong > < / p >
2022-03-27 20:56:26 +08:00
< img alt = "" src = "https://assets.leetcode.com/uploads/2021/01/04/list2.jpg" style = "width: 542px; height: 222px;" / >
< pre >
< strong > Input:< / strong > head = [1,1,2,3,3]
< strong > Output:< / strong > [1,2,3]
< / pre >
< p > < / p >
< p > < strong > Constraints:< / strong > < / p >
< ul >
< li > The number of nodes in the list is in the range < code > [0, 300]< / code > .< / li >
< li > < code > -100 < = Node.val < = 100< / code > < / li >
< li > The list is guaranteed to be < strong > sorted< / strong > in ascending order.< / li >
< / ul >