logo

Let's say there are two lists of varying lengths that merge at a certain point; how do we know where the merging point is?

Let's say there are two lists of varying lengths that merge at a certain point; how do we know where the merging point is?

题目类型: 技术面试题

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

难度: hard

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

参考答案摘要

You begin with List 1 and assume that the NULL at the end is a pointer to the start of List 2, giving the illusion of a cyclic list. After that, the algorithm will inform you how far down List 1 the m...

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

← 返回面试题库

Let's say there are two lists of varying lengths that merge at a certain point; how do we know where the merging point is?

Hardlinked-listdata-structures

想查看完整答案?

登录匠人学院学习中心,获取 STAR 格式回答和详细技术解析

前往学习中心查看答案