Leetcode-83. Remove Duplicates from Sorted List

前言：为了后续的实习面试，开始疯狂刷题，非常欢迎志同道合的朋友一起交流。因为时间比较紧张，目前的规划是先过一遍，写出能想到的最优算法，第二遍再考虑最优或者较优的方法。如有错误欢迎指正。博主首发CSDN，mcf171专栏。

博客链接：mcf171的博客

——————————————————————————————

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.

这个题目也没啥好说的。。 Your runtime beats 15.40% of java submissions.

public class Solution {
    public ListNode deleteDuplicates(ListNode head) {
        
	if(head == null || head.next == null) return head;
	
	ListNode searchNode = head.next;
	ListNode lastNode = head;
	while(searchNode != null){
		if(searchNode.val > lastNode.val) {lastNode.next = searchNode; lastNode = lastNode.next;}
        else lastNode.next = null;
        searchNode = searchNode.next;
	}
	return head;	
    }
}