If the head of a linked list contains a cycle, then determine whether the list has one. It is possible to create a cycle in a linked list by including nodes that are reachable again by following the next pointer.

If the head of a linked list contains a cycle, then determine whether the list has one. It is possible to create a cycle in a linked list by including nodes that are reachable again by following the next pointer.

题目类型: 技术面试题

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

难度: easy

标签: interviewbit, maq, company-specific

目标公司: MAQ Software

参考答案摘要

The index of the node to which the tail of the next pointer is connected is used to determine whether there is a cycle. If there is not a cycle, then return true. Otherwise, return false. Example 1: I...

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