然而，这些特性在我的工作列表中是属于优先级较低的。

These however are only my low priority to do list.

youdao

同样，这个列表是我在进行方案工作时逐渐开发出来的；您在这里所见的是该列表的最终形式。

This list, again, is developed over time as I work on the scenarios; what you see here is the final form of the list.

youdao

这样做使得我能够删除或替代当前的子节点，而不丢失我在列表中的踪迹。

This allows me to delete or replace the current child without losing track of where I am in the list.

youdao

Still quadratic, right? I'm looking for the worst case behavior, it's still quadratic, it's quadratic in the length of the list, so I'm sort of stuck with that.

还是平方，对吧,我在寻找最坏的情况，它还是平方，它是列表长度的平方，我对此有点无奈了。

麻省理工公开课 - 计算机科学及编程导论课程节选

How do I figure that out? Well I'm looping down the list, right? I'm walking down the list.

怎么算出来的呢？我在循环遍,历这个列表对吧？那要遍历这个列表。

麻省理工公开课 - 计算机科学及编程导论课程节选

And then, if I want to find out if something's there, I do the same thing. But notice now, hash is converting the input into an integer.

然后，我想查找出某些元素是否在列表中,我做同样的事，但是现在注意，哈希是将输入转化成一个整数，所以，其思想是什么？

麻省理工公开课 - 计算机科学及编程导论课程节选