题解 | #删除链表峰值#

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