-
At that stage we can merge these, and then take this down, do the division merge and bring them back up.
在那里做一次分解，做到这步时，我们可以把这些进行合并，然后把这个拿下来,做分解合并过程后再把它们拿回去。
-
You know, just the idea of taking clay figures and moving them bit by bit by bit by bit and then filming shot per shot.
就像拿着泥人，把它们一点一点地摆弄然后再一个镜头一个镜头地拍成电影。
-
I just kept sub-dividing down until I got really easy problems, and then I combine them back.
我不断的进行子分解,直到得到简单的问题，然后我再把它们合并回去。
-
And if I want to detach it, I just click and drag, and now I can go back and put different puzzle pieces there altogether.
另外，假如我想分离它，我只需要单击并拖动，然后就可以回到过去那个状态,再继续把不同的拼图放到一起。
-
The reason that 3' is important is that when you polymerize two nucleotides together and a third nucleotide, and a fourth nucleotide, when you polymerize nucleotides together they get polymerized, the phosphate of one gets linked to the 3' carbon of another.
'碳部位重要是因为,当你把两个核苷酸聚合在一起,然后再聚合第三个,第四个的时候,核苷酸在聚合时,磷酸基与另外一个戊糖的3'碳部位连接
-
You can't just add up all the pleasures and subtract the pains, or add up all the accomplishments and subtract the failures, or add up all the knowledge and subtract the ignorance and deception.
你不能只是把快乐加起来然后减去痛苦，或者仅是把成功相加再减去失败，或者把学问相加再减去蒙昧和欺骗。
-
the economy begins to recover, and then Hoover and the Congress decided what to do to fix things and they immediately make things worse, and Franklin Roosevelt comes in and keeps fixing it and keeps fixing it and keeps fixing it and the thing is bad bad bad.
经济开始复苏，然而胡佛和国会,却决定开始干预,并且他们一出手就把事情弄得很糟，然后富兰克林上任,不断再修理,不断修理不断修理,情况还是很糟糕很糟糕。
-
Instead of summing them and dividing by M, I multiply them all together and take the nth root of them.
我把所有的乘在一起然后开n次方,而不是把他们加总再除以个数
-
Because just the act of explaining it to him or her has helped me understand it.
然后再把它们送走,因为给它们解释的这个过程。
-
I'll compute its value. Then I'll empty the backpack out, put another combination of stuff compute its value, try all possible ways of filling up the backpack, and then when I'm done, I'll know which was the best.
直至把它填满，然后计算价值,然后我把包里的东西都导出来,再换一堆东西计算它们的价值,尝试过所有填满包的方案后,我就知道哪一种方案是最好的了。
-
And uncomment that, and uncomment it again.
然后把注释去掉，然后再取消注释一遍。
-
Knowing that, I'm going to say, OK, how many pigs are there, well that's just how we're, however many I had total, minus that amount, and then I can see, how many legs does that give, and then I can check, that the number of legs that I would get for that solution, is it even equal to the number of legs I started with, ah! Interesting. A return.
它将给我返回头的总数，知道了这些之后我可以说好了,有多少猪呢，无论有多少组鸡的数目，我只要用总数减去那个值,之后我就可以知道一共有多少条腿,然后再把这个值和题目中的腿数相比较，看它是否等于一开始的腿数,啊！真有趣，有一个返回值。
-
OK. Binary search is perhaps the simplest of the divide and conquer algorithms, and what does that mean? It says, in order to solve a problem, cut it down to a smaller problem and try and solve that one.
好了，二分搜索也许是,最简单的分治算法，这意味着什么？,也就是说，为了解决一个问题,把它切割成小的问题,然后再来一个个解决。
-
So to just preface what we're going to do next time, what would happen if I wanted to do sort, and rather than in sorting the entire list at once, I broke it into pieces, and sorted the pieces, and then just figured out a very efficient way to bring those two pieces and merge them back together again?
所以为了引导下一次,我们要讲的内容,如果我想做排序,而且不是一次吧整个列表排完,会发生什么，我把它拆成小的列表,然后把各个小列表排序,接着用高效的方法再把小的列表？
-
If I want to move this stack here, I'm going to take a stack of size n minus 1 move it to the spare spot, now I can move the base disk over, and then I'm going to move that stack of size n minus 1 to there. That's literally what I did, OK?
如果我想移动这些圆盘，我先把从n-1个圆盘1,移动到多余的柱子上去，这样我就能把最底下的圆盘放到这儿了，然后再把从n-1个圆盘放到这儿来,这就是确切的我怎么做的对不对？
-
We can put a list in the list again, as we've seen before. So let's put the list containing the string a, and I'll print out so now we see something pretty interesting about a list, that we can mix up all sorts of things in it, and that's OK.
数组放到数组中去，让我们把这个包含,字符串a的数组放进去,然后再显示，我们看到了一些,挺有趣的事情：我们可以把各种,各类的东西混合着放进去，没问题。
应用推荐