LintCode 112. JavaScript algorithm to delete duplicate elements in sorted linked list

description

Given a sorted linked list, delete all duplicate elements and leave only one for each element.

Sample

- 样例 1:
	输入:  null
	输出: null


- 样例 2:
	输入: 1->1->2->null
	输出: 1->2->null

- 样例 3:
	输入: 1->1->2->3->3->null
	输出: 1->2->3->null

Parsing

const deleteDuplicates = function (head) {
    
    
   if (head === null) {
    
     return null }
    var node = head;
    while (node.next !== null) {
    
    
        if (node.val == node.next.val) {
    
    
            node.next = node.next.next;
        } else {
    
    
            node = node.next;
        }
    }
    return head;
}

operation result

Insert picture description here

Insert picture description here

Guess you like

Origin blog.csdn.net/SmallTeddy/article/details/108724466