83. Remove Duplicates from Sorted List #

Problem #

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

Example 1:


Input: 1->1->2
Output: 1->2

Example 2:


Input: 1->1->2->3->3
Output: 1->2->3

Problem Summary #

Delete duplicate nodes in the linked list to ensure that each node appears only once.

Solution Approach #

Just follow the problem statement.

Code #


package leetcode

/**
 * Definition for singly-linked list.
 * type ListNode struct {
 *     Val int
 *     Next *ListNode
 * }
 */

func deleteDuplicates(head *ListNode) *ListNode {
	cur := head
	if head == nil {
		return nil
	}
	if head.Next == nil {
		return head
	}
	for cur.Next != nil {
		if cur.Next.Val == cur.Val {
			cur.Next = cur.Next.Next
		} else {
			cur = cur.Next
		}
	}
	return head
}