《leetCode-php》去掉有序链表中重复的值

给出一个排好序的链表，删除链表中的所有重复出现的元素，只保留原链表中只出现一次的元素。 

例如： 

给出的链表为1->2->3->3->4->4->5, 返回1->2->5.

给出的链表为1->1->1->2->3,  返回2->3.

思路：这个主要是头结点怎么处理

<?php
class Node {
    public $next = null;
    public $val;
    public function __construct($val) {
        $this->val = $val;
    }
}
function deleteDuplicates($head) {
    //先要找一个新的头节点,方便找到下一个头结点
    $newHead = new Node($head->val - 1);
    $newHead->next = $head;
    $node = $newHead;
    $pre = $newHead;//用来记录前一个节点
    while ($node != null) {
        if ($node->val == $node->next->val) {
            $node1 = $node->next;
            while ( $node1 != null && $node1->val == $node->val) {
                $node1 = $node1->next;
            }
            $pre->next = $node1;
            $node = $node1;
            continue;
        }
        $pre = $node;
        $node = $node->next;
    }
    return $newHead->next;
}
$node1 = new Node(1);
$node2 = new Node(2);
$node3 = new Node(2);
$node4 = new Node(2);
$node5 = new Node(3);
$node6 = new Node(3);
$node7 = new Node(4);
$node1->next = $node2;
$node2->next = $node3;
$node3->next = $node4;
$node4->next = $node5;
$node5->next = $node6;
$node6->next = $node7;
$ret = deleteDuplicates($node1);
while ($ret != null) {
    print $ret->val . "\n";
    $ret = $ret->next;
}