当前位置:首页 > 开发 > 编程语言 > 编程 > 正文

Remove Duplicates from Sorted List

发表于: 2015-07-06   作者:hcx2013   来源:转载   浏览:
摘要: Given a sorted linked list, delete all duplicates such that each element appear only once. For example,Given 1->1->2, return 1->2.Given 1->1->2->3->3, return&

Given a sorted linked list, delete all duplicates such that each element appear only once.

For example,
Given 1->1->2, return 1->2.
Given 1->1->2->3->3, return 1->2->3.

 

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
public class Solution {
    public ListNode deleteDuplicates(ListNode head) {
    	if (head == null) {
    		return head;
    	}
    	ListNode start = head;
    	ListNode end = head.next;
    	while (end != null) {
    		if (start.val == end.val) {
    			end = end.next;
    			if (end == null) {
    				start.next = null;
    			}
    		} else {
    			start.next = end;
    			start = start.next;
    			end = end.next;
    		}
    	}
    	return head;
    }
}

 

Remove Duplicates from Sorted List

  • 0

    开心

    开心

  • 0

    板砖

    板砖

  • 0

    感动

    感动

  • 0

    有用

    有用

  • 0

    疑问

    疑问

  • 0

    难过

    难过

  • 0

    无聊

    无聊

  • 0

    震惊

    震惊

编辑推荐
Given a sorted linked list, delete all duplicates such that each element appear only once. Fo
Given a sorted linked list, delete all duplicates such that each element appear only once. Fo
原题: Given a sorted linked list, delete all duplicates such that each element appear only o
1 题目 Given a sorted linked list, delete all duplicates such that each element appear only o
1 题目 Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only
Remove Duplicates from Sorted Array Given a sorted array, remove the duplicates in place such
Question: Given a sorted array, remove the duplicates in place such that each element appear
Follow up for "Remove Duplicates": What if duplicates are allowed at most twice? For example,
Question: Follow up for "Remove Duplicates": What if duplicates are allowed at most twice? Fo
一.题目描述 二.解题技巧 从题目中可知,数组中的元素事先已经过排序,因此一个简单而易于实现的方
版权所有 IT知识库 CopyRight © 2009-2015 IT知识库 IT610.com , All Rights Reserved. 京ICP备09083238号