-
You can't just say it once. You have to try to fill that void by saying it two times and by invoking his father a third time.
你不能只讲一次，你必须说第二遍,并且第三次提到迪安的父亲，来填补中间的空隙。
-
And um, eventually, at first, I was just, you know, sitting in, but then I had to take a licensing exam
一开始我只坐在那里，可是之后还要进行一次许可考试，
-
I first tested it on the square root of 4 and in one iteration it found 2.
我首先测了下求4的平方根4,它只迭代了一次并返回了2。
-
Also, in a very different mood, the poem "For Once, Then, Something."
还有另一首完全不同的情绪的诗，“只一次，便成永远“
-
Again, if you just thought about life as a ruler, well pretty good thinking about it in isolation.
再一次，如果你只考虑了统治者的生活，非常好地单独考虑。
-
For example, the stock market crash of 1929 is repeatedly re-expected even though it only happened once; it's just prominent in our thinking.
929年股市崩盘,就被反复提及,尽管这只发生过一次,但是人们对它影响深刻
-
On each level in the picture, I'm touching each number once, alright.
在这幅图的每一层上，我只会移动每个数字一次。
-
You probably will get into the section you want once we're done.
一般你只需要预约一次就可以了
-
If you're taking only one derivative you can add a constant.
如果只进行一次求导,你可以添加一个常数项
-
It's a huge price to pay in a pass-no-record first semester class . And, you know who is most severe on the committee on discipline?
这个代价太大了，只为了,第一次学期通过一门无记录的课程,你们知道着纪律委员会,谁最为严厉吗？
-
We have a couple of passages, one in the book of Numbers, one in the book of Job, which describe this condition in a way that identifies it with death. An aborted fetus is often not often, it happens once in the book of Job.
有两篇文章，一篇在《民数记》,一篇在《约伯记》里，描述了这种,意味着死亡的状况，比如说，一个被流产掉的胎儿就,但这些例子不多，只在《约伯记》里出现了一次。
-
All right, so one thing that I want to point out, which I said many, many times on Friday, and this is perhaps the last time I'll say it, but one last time is we can think about why we only see a line for the 2 p orbital, versus we don't see separate lines for a 2 p x, a 2 p y, and a 2 p z.
好的，我还要指出一个问题，这个问题我在上周五已经说了很多很多次了，这可能是我最后一次提到它，但是这最后一次让我们来考虑一下,为什么我们只看到了一条，对应于，2，p，轨道的线,而不是分别对应于，2，p，x，2，p，y，2，p，z，的线？
-
And typically, I'm not going to just search once in a list, I'm going to search multiple times.
还要考虑我要如何去使用它？,我不会对一个列表只做一次搜索。
-
That's the only time since World War II that we've had a higher level of residential investment.
如此巨额的住宅投资,自二战以来只出现过一次
-
So in other words, every time I merge the point that I kept emphasizing verbally there and that I'm only touching each number once, means that we have to account for the amount of time it takes to merge N which is going to be just N. Now, this is again one of these cyclical answers.
换言之，之前在做合并时,我不停地强调,对每个数字我只碰了一次，这就是说,我们要记录合并所花的时间量,也就是这里的,这又是一种循环性的答案。
-
Remember last time, I said that there's different kinds of complexity in our code, and I suggested for simple branching programs, the amount of time it takes to run that program is, in essence, bounded by the number of instructions, because you only execute each instruction at most once.
但是这里有个很重要的点,记得上节课，我提过在我们的代码中，有不同种类的复杂度，而且我还说了对于简单的分支程序,运行这种程序需要的总体时间,大体上，是和指令的数目相关的,因为每个指令只会被执行最多一次。
-
One, two, three, four, so on each level of the picture I'm drawing, I've seem only to be looking at each number once.
，2，3，4，可见，在我画的,这幅图的每一层上，对每个数字,都只会用到一次。
-
You have to touch each of the 16 elements once as I go across the blackboard to actually merge them together, alright.
为了将这16个元素,合并到一起,对每个元素都只会用到一次。
-
That's the finger thing from left finger to right finger going back and forth across the board, never touching a number more than once.
在合并时，我的左手手指,和右手手指来回地在黑板上移动，但对每个数字只会碰到一次。
-
But that merging process only takes N steps, N*log N so that's N times log of N. Now, it's a little tricky to reason through this perhaps the first time, let's just take a very simple example and see if we can do a little sanity check here.
但这个合并过程只需要N步，所以时间复杂度是,第一次对此进行推论可能会有点儿棘手，我们举一个简单的例子,看看我们能否做一些完整性的检查。
-
Say, we're just doing this once and don't expect it again.
就说,我们只分一次红,别想有下次
应用推荐