-
One of the advantages of this is, that I don't have to worry about explicitly updating my variable. That happens for me automatically.
这样继续下去，这样做的一个优点是,我不用为更新变量来发愁了,程序会自动的为我进行这个操作，这一点很好。
-
If I do this, try and get the 10th element of a list that's only eight long. I get what looks like an error, but it's actually throwing an exception.
如果我来这么做,试着去取长度为8的列表的第十个元素,我貌似能得到一个错误。
-
One of the studies that I did for my first book, Pioneering Portfolio Management, looked at the behavior of endowments and foundations around the crash in October 1987.
我为第一本书《机构投资的创新之路》,所做的其中一个研究,是关于1987年10月那次股灾前后,各种捐赠和基金的表现
-
If you pay me ten thousand dollars a month to work for you, I'll work for you and I'll think "I'm doing it for ten thousand dollars a month, that makes a lot of sense," but if I do it for nothing then I have to ask myself, "Why am I doing it?"
如果你一个月给我一万美元帮你工作，我会为你工作，但我会想,”我是为了一万美元才做的，这样更合理“,但如果我一点报酬都没有，那我就会问我自己，”我为什么要做这份工作？”
-
When you declare a pointer yourself manually, you do say char * the variable name because recall that's the same thing that we did earlier but we called it instead string.
当你手动声明一个指针是，你可以说char，*，变量名字,因为那是我早些时候做的事情,但是我们叫它为字符串。
-
There are two possibilities. If the answer is yes, then I'm still looking for the answer, what do I want to do? Well, I don't have to do anything other than change the counter.
这就是一个测试，有两种可能的结果，如果结果为是的话，然后我就要继续找寻目标数,我该怎么做呢？好。
-
Do one comparison and return one of two possible orders on it, but I need to decide that.
虽然可以做一次比较,然后返回两个可能的顺序中的一个为结果，但是这需要我来做决定。
-
And the second point is of radius 3 and angle 1, which is up about there.
半径为2然后角度为1的一个点,也就是差不多在这儿，我认为为了确保我做的是。
-
So let's look at the second example, all right, I keep doing that -- this piece of code from here to here gives me a way of now creating a hash table of size 256.
所以让我们来看一下第二个例子，好的，我继续做那件事,这段代码中从这里到这里,是创建一个大小为256的哈希表。
-
I'll let you just grok it but you can see it's basically doing what I did over there. Setting up two indices for the two sub-list,it's just walking down, finding the smallest element, putting it into a new list. When it gets to the end of one of the lists, it skips to the next part, and only one of these two pieces will get called because only one of them is going to have things leftovers.
你们可以大体的浏览一下,但是它们基本就是我在那里所做的事情,为两个子列表设置了两个指针,指针顺着列表走下去，找到最小的元素,把它放入到一个新的列表中去,当它走到一个列表的尾部时,它会跳到下部分去,两部分中只有一个会被执行,因为只有一个会有元素剩余。
-
That means starting at the first one, I'm going to do something to it. And what am I'm going to do? I'm going to take that character, convert it back into an integer, and add it into some digits. And I've done a little short hand here, which is I should have said some digits is equal to some digits plus this.
这意味着从第一个字符开始，我要对他们进行一些操作,我要去做什么呢？我要取得这个字符，然后把它转换为整数,然后加到某些数上面去,我在这里用了一些缩写,我本来应该写一个数字等于这个数字。
-
It says, if I want to print out something I built in Cartesian form up here, says, again, I'm going to pass it in a pointer to the instance, that self thing, and then I'm going to return a string that I combine together with an open self and close paren, a comma in the middle, and getting the x-value and the y-value and converting them into strings before I put the whole thing together.
这不仅仅是个列表,它是怎么来做的？,流程是：如果我想要返回,一些已经在笛卡尔模式下建好的值，好，再说一遍，我首先要传入一个,指向实例的指针,也就是，然后我会返回一个,由开括号，闭括号,中间的一个逗号,以及提前转换为字符串格式的。
-
And that shows you one other nice little thing we want to do, which is if I look in this code notice I set up a variable up here called false Solution Found, initially bound to false.
这显示了我们想要做的另一件事,那就是我在这段代码中设置了一个,名为Solution，Found的变量,初始值设为。
应用推荐