题解 | #删除链表峰值#

/**
 * struct ListNode {
 *	int val;
 *	struct ListNode *next;
 *	ListNode(int x) : val(x), next(nullptr) {}
 * };
 */
class Solution {
public:
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param head ListNode类 
     * @return ListNode类
     */
    ListNode* deleteNodes(ListNode* head) {
        // write code here
        if(head==nullptr || head->next == nullptr){
            return head;
        }
        auto *pre = head;
        ListNode *current;
        current = head->next;
        while(current != nullptr){
            if(current->next && current->next->val < current->val){
                pre->next = current->next;
                pre = pre->next;
                if(pre){
                    current = pre->next;
                }else{
                    break;
                }
            }else{
                pre = current;
                current = current->next;
            }
            
        }
        return head;

    }
};