LeetCode——删除排序链表中的重复元素
题目描述:
给定一个排序链表,删除所有重复的元素,使得每个元素只出现一次。
示例 1:
输入: 1->1->2
输出: 1->2
示例 2:
输入: 1->1->2->3->3
输出: 1->2->3
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/remove-duplicates-from-sorted-list
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
解题思路:
这里提供三种解法
解法一:直接法
直接循环,判断当前指针位置的值和下一个值是否相等,如果相等则让next指向后面的next。
即:cur.next = cur.next.next;如果不相等则直接将cur往后移。
解法二:双指针法
定义两个指针,一个为pre,记录上一个不重复的元素,cur代表当前位置。每次判断当前位置元素是否与pre元素值相等,相等则跳过,更新cur;不等则把pre指向当前元素cur,更新pre为cur,再更新cur。
解法三:递归法
这里提供三种解法的Java代码和Python代码。
直接发的Java代码:
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
class Solution {
public ListNode deleteDuplicates(ListNode head) {
if(head == null){
return head;
}
ListNode cur = head;
while(cur.next != null){
if(cur.val == cur.next.val){
cur.next = cur.next.next;
}
else{
cur = cur.next;
}
}
return head;
}
}
LeetCode测试结果:
直接法Python代码:
# Definition for singly-linked list.
# class ListNode(object):
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution(object):
def deleteDuplicates(self, head):
"""
:type head: ListNode
:rtype: ListNode
"""
if head is None:
return head
cur = head
while(cur.next is not None):
if cur.val ==cur.next.val:
cur.next = cur.next.next
else:
cur = cur.next
return head
LeetCode测试结果:
双指针法Java代码:
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
class Solution {
public ListNode deleteDuplicates(ListNode head) {
if(head == null){
return head;
}
ListNode pre = head;
ListNode cur = head.next;
while(cur != null){
if(pre.val != cur.val){
pre.next = cur;
pre = cur;
}
cur = cur.next;
}
pre.next = null;
return head;
}
}
LeetCode测试结果:
双指针法Python代码:
# Definition for singly-linked list.
# class ListNode(object):
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution(object):
def deleteDuplicates(self, head):
"""
:type head: ListNode
:rtype: ListNode
"""
if head is None:
return head
pre = head
cur = head.next
while(cur is not None):
if pre.val != cur.val:
pre.next = cur
pre = cur
cur = cur.next
pre.next = None
return head
LeetCode测试结果:
递归法Java代码:
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
class Solution {
public ListNode deleteDuplicates(ListNode head) {
if(head == null || head.next == null){
return head;
}
head.next = deleteDuplicates(head.next);
if(head.val == head.next.val){
head = head.next;
}
return head;
}
}
LeetCode测试结果:
递归法Python代码:
# Definition for singly-linked list.
# class ListNode(object):
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution(object):
def deleteDuplicates(self, head):
"""
:type head: ListNode
:rtype: ListNode
"""
if head is None:
return head
pre = head
cur = head.next
while(cur is not None):
if pre.val != cur.val:
pre.next = cur
pre = cur
cur = cur.next
pre.next = None
return head
LeetCode测试结果: