Though smaller than the Hope Diamond, gemologists say the Cullinan Diamond is just as beautiful.
VOA: special.2010.11.12
We can actually have any radius, but some radii just have much, much smaller probabilities of actually being significant or not.
非常非常小,以至于,无关紧要,我们今天。
And Brooklyn, especially, it was just a smaller environment where I was able to flourish
尤其是在规模较小的布鲁克林,我感到事事顺心。
It's just the number that was picked between 1 and 10 that's probably bigger than 5 or 6, not smaller.
它产生一个在1到10之间的数0,或者大于等于5或者6的数。
That is if I can write code that would solve all instances of smaller size strings, then what I just described isPalindrome will solve the larger size one.
然后我会描述如何处理大字符串,事实上这正是我所做的,我希望你能看看这边的这段代码,就是这个。
All right. The rules, though, are, they can only move one disk at a time, and they can never cover up a smaller disk with a larger disk. OK. Otherwise you'd just move the whole darn stack, OK?
好,规则是,他们只能一次挪动一个盘子,并且不能把大盘子放在小盘子上,不这样的话你就直接,把这一堆盘子都挪过来了对不对?
Again, for those-- for whom this is blocked, I'm just dividing the rectangle into smaller squares which is to say that memory is addressable.
这是一整块的,我只是把它划分成一个个小区域,每个小区域都可以设定一个地址。
On the other hand, if the value I'm looking for here- sorry, the value I'm looking for is smaller than the value I see here, I just need to look here. All right?
如果我的目标数比这个值要小呢?,我就在这边找就对了,对不对?,做完了这一步,我可以在下一步做相同的操作,假设我选中了这一分支?
it's looking first to see am I in the base case, which I'm done. If I'm not I'm just going to reduce this to a smaller computation.
注意这个计算是干什么的,它先判断我是否属于基础事件,这个我已经做过了。
I just reduced it to a smaller version of the same problem.
我刚刚把它简化为一个更小的同类问题,这就是我可以写出能解决更短字符串的例子。
I didn't just make it one smaller, I made it a half smaller. That's a nice deal.OK.
我把它的规模减半了,这太棒了,好,但是我不会直接处理b是偶数这种情况的。
It's going to let j run over the length of the list all right, so it's going to start at some point to move down, and then it's going to let i run over range, that's just one smaller, and what's it doing there?
就在这里,会做什么呢?,我们让j遍历这个列表,好的,它要从某一定开始移动,然后让i也跑遍整个范围,就是比之要小一,会发生什么?
应用推荐