题解 | #删除链表峰值#

import java.util.*;

/*
 * public class ListNode {
 *   int val;
 *   ListNode next = null;
 *   public ListNode(int val) {
 *     this.val = val;
 *   }
 * }
 */

public class Solution {
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param head ListNode类 
     * @return ListNode类
     */
    public ListNode deleteNodes (ListNode head) {
        //解决边界(链表长度小于等于2,直接返回)
        if(head == null || head.next == null || head.next.next == null){
            return head;
        }

        ListNode pre = head;
        ListNode curNode = head.next;
        ListNode post = head.next.next;

        while (post != null) {
            if (curNode.val > pre.val && curNode.val > post.val) {
                pre.next = post;
                curNode = post;
                post = post.next;
            }else {
                pre = curNode;
                curNode = post;
                post = post.next;
            }
        }
        return head;
    }
}