This problem is as same as https://www.cnblogs.com/feiflytech/p/16169025.html
class Solution { public int[] nextLargerNodes(ListNode head) { List<Integer> list = new ArrayList<>(); ListNode point = head; while(point!=null) { list.add(point.val); point = point.next; } Stack<Integer> stk = new Stack<>(); int[] res = new int[list.size()]; for(int i=0;i<list.size();i++){ while(!stk.isEmpty()&&list.get(i)>list.get(stk.peek())){ res[stk.pop()]=list.get(i); } stk.push(i); } return res; } }
版权声明:本文内容由互联网用户自发贡献,该文观点与技术仅代表作者本人。本站仅提供信息存储空间服务,不拥有所有权,不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容, 请发送邮件至 dio@foxmail.com 举报,一经查实,本站将立刻删除。