排序单链表去重复元素

class ListNode {
    int val;
    ListNode next;

    ListNode(int x, ListNode next) {
        val = x;
        this.next = next;
    }
}

public class Solution {
    public ListNode deleteDuplicates(ListNode head) {
        if (head == null || head.next == null)
            return head;
        ListNode q = head;
        while (q.next != null) {
            if (q.val == q.next.val) {
                q.next = q.next.next;
            } else {
                q = q.next;
            }
        }
        return head;
    }

    public ListNode deleteDuplicates2(ListNode head) {
        if (head == null || head.next == null)
            return head;
        head.next = deleteDuplicates2(head.next);
        return head.val == head.next.val ? head.next : head;
    }

    public ListNode deleteDuplicates3(ListNode head) {
        if (head == null || head.next == null)
            return head;
        ListNode left = head;
        ListNode right = left.next;
        ListNode pre = left;
        while (right != null) {
            if (right.val == left.val) {
                pre = right;
                right = right.next;
                continue;
            }

            if (pre != left) {
                left.next = pre.next;
            }

            left = left.next;
            right = left.next;
            pre = left;
        }

        left.next = null;
        return head;
    }

    public static void print(ListNode head) {
        while (head != null) {
            System.out.print(head.val + " ");
            head = head.next;
        }
        System.out.println();
    }

    public static void main(String[] args) {
        ListNode _4 = new ListNode(3, null);
        ListNode _3 = new ListNode(3, _4);
        ListNode _2 = new ListNode(2, _3);
        ListNode _1 = new ListNode(1, _2);
        ListNode head = new ListNode(1, _1);
        ListNode result = new Solution().deleteDuplicates(head);
        print(result);
    }
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值