-
As every time we introduce a new programming concept, we'll relate it back, as we have been doing consistently, to defensive programming.
我们每次介绍一个,新的编程概念的时候，就会和以前讲的联系起来，就和我们介绍防卫性程序设计一样。
-
In every context in which I place a body, I'll have to know what are the forces acting on it.
每次我拿一个物体举例子时,我就得知道有哪些力作用在物体上
-
I'll count up the number of people killed in every church that I go to visit to look at.
每次我去一个教堂里,我都会数当地记录的阵亡人数
-
I'm walking along the list once, taking two things and saying, make sure the biggest one is next.
我遍历一次列表，每次取两个值,确认最大的元素在后面一个。
-
Remember, every time we have two electrons that are being shared, that's a single bond.
还记得，每次我们有两个电子被共用，我们就有了一个单键。
-
Not to harp on the mathematical features of this, but cubing, AX*X*X you know, if you're starting to do AX star, X star, X, every time you want to cube some value in a program, it just feels like this is going to get a little messy looking, if nothing else.
不要总是说这个的数学特性，但是体积，你们懂的，如果你开始做，在一个程序中，每次你想算几个数值的体积，感觉它就变得,有一点凌乱的，如果没有其他的。
-
And in each election, they would come forward and say, "we are not really a left wing party, we're a centrist party these days" And people would say, we don't believe you.
每次选举的时候,他们都会声称,我们不是一个左翼政党,我们现在是中间派,但是选民都不相信他们
-
But you don't want to have to run it a long time, every time you have a hypothesis.
但是你不必每次有一个假设，都要去运行很长时间。
-
Every time I use it, I'm creating a new instance, that's a different thing inside of memory.
我每次调用它，我就新建了一个类，这在内存中是个不同的事情。
-
The loop invariant what does the loop invariant mean? It says, here is a property that is true of this structure every time through the loop.
循环不变量是什么意思？,它是一个在结构体中,每次循环都为真的属性。
-
And I want to remind you, that block of code is a set of instructions, the same set of instructions that are going to be done each time through the loop.
我想提醒大家,这块代码是一个指令集,一个每次循环都会被执行的相同指令集,会变化的仅仅是变量的值。
-
It's basically cycling through the loop a multiplying by a each time.
这个代码就是简单的循环,每次乘一个。
-
It took me seven comparisons, because I can take advantage of the fact I know I only ever have to look at the first element of each sub-list. Those are the only things I need to compare, and when I run out of one list, I just add the rest of the list in.
进行了7次对比，因为我可以利用我知道的优势：,每次只需要比较每个子列表的第一个元素,那才是我需要进行对比的内容,当一个列表的元素处理完了,只需要将另一个列表剩下的元素直接添加进去。
-
And this is useful because if you're actually writing a program that's interactive or that you want to change overtime much like you would a game, hopefully, the game is not going to have the bad guys, for instance, always standing in the same place or the rocks or whatever it is falling from the sky in the same place 'cause it would very quickly become a very tedious game.
这是很有用的，因为如果,写一个交互的程序或者,希望每次游戏都不一样，我们希望，游戏中的坏人物，别老是站在同一个地方或者同一块石头上,或者从天空中同样的位置落下,因为这立刻会使游戏变得乏味。
-
And unlike n, l can start all the way down at 0, and it increases by integer value, so we go 1, 2, 3, and all the way up.
不像n，l可以从0开始取，然后每次增加一个整数，所以我们可以去1，2，3，一直下去。
-
Whenever I think about how to build an interesting program, and I hope whenever you think about it, the first thing I think about is, what are the classes I might want to have, what are the types?
无论我何时,去想怎样建立一个有趣的程序，你们每次做这种思考的时候，你们想得第一件事，就是我应该要有什么类呢，它们是什么类型的呢？
-
Every time you see a square bracket, put a paren in. All right?
每次你看到一个方括弧，你就得在此添加一个圆括弧，明白了吗？
-
And then I'll create this function, d1 this distribution d 1, which will, whenever I call it, give me a random, a uniformly selected value between minus and plus volatility.
然后我会创建这个函数，这个概率分布，每次我调用这个函数的时候，他会给我返回一个随机的，按照均匀分布,从正负浮动值之间选择的值。
-
So, that's sort of the mathematically how we get to a, but we can also just look at the graph here, because every time we go one wavelength we can see that we're back in a maximum.
这是就我们得到a的数学,办法，但我们可以直接,从图上看，因为每次我们,经过一个波长，都回到一个最大值。
-
Well, int is almost always 32 bits at least so far as we've seen so, in fact, any time I draw a pointer hence force I'm just going to draw a square as well because they are, in fact, the same size usually in memory.
嗯，int几乎总是32位的,至少我们至今所看到的是这样的，每次我用一个正方形表示一个指针,因为实际上他们，在内存中的大小是一样的。
-
And now we get the p orbitals, remember we want to fill up 1 orbital at a time before we double up, so we'll put one in the 2 p x, then one in the 2 p z, and then one in the 2 p y.
我们到了p轨道，记住在双倍填充之前,我们想要每次填充至一个轨道，所以我们在2px填充一个然后2pz填充一个，然后2py填充一个。
-
I'm going to give a name to that. And what you see there is I'm going to call divisors initially an empty tuple, something has nothing in it. Right here. And then I'm going to run through the same loop as before, going through this set of things, doing the check.
你们可以看到这里,我初始化一个空的元组,名为divisiors，这里，然后我会去运行,跟以前一样的循环，遍历这个集合内的东西,然后做检查，现在我要做的是，每次我找到了一个除数我要把它收集起来。
-
I think most and you are familiar with the Aufbau or the building up principle, you probably have seen it quite a bit in high school, and this is the idea that we're filling up our energy states, again, which depend on both n and l, one electron at a time starting with that lowest energy and then working our way up into higher and higher orbitals.
我认为你们大多数熟悉奥弗堡,或者构建原理，你们可能,在高中见过它，又一次,这是我们填充能级的观点，与n和l有关，一个电子每次从,最低的能级开始,然后以我们的方式上升到,更高更高的轨道。
应用推荐