链表中的下一个较大节点(JavaScript)

function ListNode(val) {
  this.val = val;
  this.next = null;
}

function nextLargerNodes(head) {
  const stack = [];
  const result = [];
  
  let index = 0;
  let curr = head;
  
  while (curr) {
    while (stack.length > 0 && curr.val > stack[stack.length - 1].val) {
      const node = stack.pop();
      result[node.index] = curr.val;
    }
    
    stack.push({ val: curr.val, index });
    result[index] = 0;
    
    index++;
    curr = curr.next;
  }
  
  return result;
}