zoukankan      html  css  js  c++  java
  • LeetCode

        Description: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.

                          给一个有序链表,删除重复的元素。还是首先考虑head == null的情况。

            

    /**
     * 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)
    			return null;
            
            ListNode p, q;
            q = head;
            p = head.next;
            while(p != null) {
            	if(p.val == q.val) {
            		q.next = p.next;
            		p.next = null;
            		p = q.next;
            	} 
            	else {
            		p = p.next;
            		q = q.next;
            	}
            }
            return head;
            
        }
    }
    
  • 相关阅读:
    apache多端口映射
    mark
    一些注册表值
    jsp URL中文处理的几种方式
    【引用】雨林木风Ghost XP SP3系统
    CentOS常用命令
    查看ie8临时文件夹
    卡塔兰数
    大数问题
    不会做的题目
  • 原文地址:https://www.cnblogs.com/wxisme/p/4418621.html
Copyright © 2011-2022 走看看