Given a singly linked list with an additional "arbitrary" pointer at each node that currently points to NULL. What algorithm will you implement to make the "arbitrary" pointer point to the next node with a greater value?

Given a singly linked list with an additional "arbitrary" pointer at each node that currently points to NULL. What algorithm will you implement to make the "arbitrary" pointer point to the next node with a greater value?

题目类型: 技术面试题

这是一道技术面试题，常见于澳洲IT公司面试中。

难度: hard

标签: interviewbit, linked-list, topic-specific, data-structures

参考答案摘要

A simple solution is to go through all nodes one by one, finding the node with the next bigger value than the current node and changing the next pointer for each node. This solution has an O time comp...

本题提供 STAR 原则详细解答和技术解析，登录匠人学院学习中心即可查看完整答案。