1019. Next Greater Node In Linked List lnkk

//https://leetcode.com/problems/next-greater-node-in-linked-list/
/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    vector<int> nextLargerNodes(ListNode* head) {
        vector<int> res;
        
        while(head->next){
            ListNode* cur = head->next;
            while(cur){
                if(cur->val > head->val){
                    res.push_back(cur->val);
                    break;
                }else{
                    cur = cur->next;
                }
            }
            if(!cur) res.push_back(0);
            head = head->next;
        }
        res.push_back(0);
        return res;
    }
};