We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
关于这篇文章,大家有什么想法可以在这里提出来
The text was updated successfully, but these errors were encountered:
赞,实现的还是很简洁的。
Sorry, something went wrong.
对于数据结构的示意图,还有P.ref[level-1]的理解,与您有些出入。。以下是我理解的示意图:
个人认为 p.refer[i-1] 不是指向的下一层节点,而是和 p.refer[i] 在同一数组的,只比它 index 小一的节点,也就是你在图中表示的 p.refer[i-1] 的下一个节点。
p.refer[i-1]
p.refer[i]
假设我们执行插入操作的 update 数组碰巧都是一竖列那种,也就意味着 update 数组的每一项都是相同的:
newNode[0] = update[0].refer[0] newNode[1] = update[1].refer[1] newNode[2] = update[1].refer[2] ...
而此时 update[0] === update[1] === update[2]
所以也就意味着refer[i-1]不是题主图画的那样呢。
refer[i-1]
No branches or pull requests
关于这篇文章,大家有什么想法可以在这里提出来
The text was updated successfully, but these errors were encountered: