So it doesn't matter how big the dictionary is, you can instantaneously retrieve the value associated with the key. Extremely powerful.
因为你可以在线性时间,内得到想要的键对应的值,这太强大了。
Which may take up some arbitrary amount of memory. In that case, I'm back to this problem.
然后将接下来的每一个内存块设置为,指向数组对应元素值的指针。
I will draw the famous picture of some particle moving and it's here at t of some value of x.
我会画某个质点运动的,经典图像,这是某个x值对应的时间t
So let's get some value right here.
它有值f,对应图中这个点;
Second thing we saw was, we saw that associated with every primitive value was a type.
我们学习到的第二件事情是,和每个基本值对应的,是一个类型。
And now we want to find the subset of a that has the maximum value, subject to the weight constraint.
会有一个值与其对应,现在我们想要找出满足,重量约束条件的a的最大值子集。
But that table does not affect any bindings for other instances of the variable like x for ANS.
这时这个局部表就消失了,这个局部表将不会影响其它赋值,比方说像ANS对应的x变量。
I can use anything I want for keys, I can use anything I want for values.
的东西作为对应的值,如果你看看这儿。
应用推荐