Remove Duplicates from Sorted List II

Link: http://oj.leetcode.com/problems/remove-duplicates-from-sorted-list-ii/

Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list.

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

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) {
 *         val = x;
 *         next = null;
 *     }
 * }
 */
public class Solution {
    public ListNode deleteDuplicates(ListNode head) {
        if (head == null || head.next == null)
            return head;
        ListNode result = new ListNode(0);
        ListNode r = result;
        ListNode p1 = head;
        ListNode p2 = head;
        
        while (p2 != null) {
            int times = 0;
            while (p2 != null && p1.val == p2.val){
                times++;
                p2 = p2.next;
            }
            if(times == 1)
            {
                result.next = p1;
                result = result.next;
            }
            p1 = p2;
        }
        result.next = null;
        return r.next;
    }
}