/** * Definition for singly-linked list. * function ListNode(val, next) { *     this.val = (val===undefined ? 0 : val) *     this.next = (next===undefined ? null : next) * } *//** * @param {ListNode} head * @return {ListNode} */varremoveNodes=function(head){letstack=[]letcurr=headwhile(curr){while(stack.length&&curr.val>stack[stack.length-1]){stack.pop()}stack.push(curr.val)curr=curr.next}//This converts the stack into a linkedlistletdummy=newListNode()letdummyCurr=dummyfor(letvalofstack){dummyCurr.next=newListNode(val)dummyCurr=dummyCurr.next}returndummy.next};