It is going to give me back a tuple a collection of two things, and so check out the syntax.
它将给我返回一个数组或者系列的一对值,然后检查一下语法。
So for example I defined p, remember back over here, as a Cartesian point, but I can actually ask for its polar form.
我可以要求返回它的极坐标形式,这里对我是可访问的,好,这很棒,请再记另外一个为什么。
Well, I'm going to get back, let's just draw a bigger square than usual that's roughly four times the size.
嗯,返回的是,我画一个更大的方形,大致上是4倍的大小。
The Republic belongs to that period of Plato's work after his return to Athens, after the execution of Socrates.
理想国》即是柏拉图,在返回雅典后的作品之一,也就是在苏格拉底被处决之后。
Well, this allows us to try to go back and explain some phenomena that over the years, mounting evidence was building that couldn't be explained.
好了,这个可以使得我们,返回去然后去解释一些,以前逐年积累的未能解释的现象,我们下节课将讨论。
In other words it doesn't just return when it finds one, it's going to run through all of them. All right?
但是它将会继续运行,换句话来说当它找到一个结果时,它不会立刻返回结果它会先遍历所有的内容?
Literally, return the control from this function, and take the value of the next expression, and return that as the value of the whole computation.
正如字面意义上说的,从这个函数返回,然后取得下一个表达式的值,并把这个值作为整个计算的结果返回。
Let's test it in all possible combinations of x and y and see if we get the right answer.
来测试并看看,返回的结果正确不正确。
It could run and give you the right answer, it could crash, it could loop forever, it could run and apparently give you the right answer.
它可能会正确运行,并返回给你一个正确的答案,它可能会崩溃,它可能会一直运行下去,它可能会运行并给你正确的答案。
1%10 So if you actually do in a program 11 percent 10, 1 what you'll get back is 1 because that is in fact the remainder of that arithmetic operation.
如果在编程里就是,返回,因为1是这个计算式的余数。
4 So even if the correct mathematical answer is 1.4 or whatever, when you divide an int by an int, you only have room in that variable, in the response for an actual integer.
所以即使那个正确的答案是4,或别的数值,当你用一个整型数除以一个整型数,在那个变量的返回值里,只有,存储一个整型数的空间。
And it's just gathering together the multiplications while counting down the exponent. And you can see it when we get down to the end test here, we're going to pop out of there and we're going to return the answer.
这个方法就是通过乘法,来一个一个的减小指数,可以看到,最后面的结果测试,我们会在这里退出,然后返回答案。
Because it says, your program will still give you a value, but it may not be what you intended, and you can't always tell, and that may propagate it's way down through a whole bunch of other computations before it causes some catastrophic failure.
因为这意味着,你的程序依然会返回一个值,但是这个值可能不是你想要的,你可能还分辨不出来,而且这种情况会传播,结果会沿着正果计算过程传播下去,直到产生一个灾难性的错误。
Then if the weight of i is less than the available weight, I can return the value of i.
然后如果i的重量,小于剩下的重量,我将返回i的价值。
I'm going to call it down here with search, which is simply going to call it, and then print an answer out.
然后返回答案,在二分法搜索中,其实有个挺美妙的名称。
And if it returns a value, you've got to do something with that return value too, much like we did up here.
如果它返回了一个值,你便用那个返回值,做一些事情,就像我们刚在上面做的。
So what I wanted to do is loop back, at least with a couple of things that we see recurring and very understandably so, but let's try to clear up a couple of frequently occurring issues.
所以我想要做的是回环,至少用两三个,我们看到的东西返回,并且可以理解地,让我们试着处理几个,频繁发生的事情。
So that's the second thing I've just highlighted here, is that I now have the ability to check whether it does the right thing.
你知道的,一个虚数,但是返回虚数就没有什么价值了,那么这是我想要强调的第二件事情。
You know when you add 2 polar forms, you add the radii together, you don't add the angles together, you need to do it in Cartesian form.
表示形式的不同理解,返回给你了不同的值,这也就带来了一系列的问题,第二个问题是。
Does it give you the answer that you expected it to give? Often, in practical problems, you'll spend just as much time doing performance debugging. Why is it slow?
它返回了期待中的结果了么?通常,在实际的问题中你会花,同样多的时间在性能调试上,它为什么运行这么慢?
So when I said earlier that as soon as swap returns, all of the memory allocated for swap is now useless.
我前面指明的,一旦swap返回,所有为swap分配的内存都是无用的了。
All right, I want to show you one last example of using recursion because we're going to come back to this. This is a classic example of using recursion. And that is dating from the 1200s and it is due to Fibonacci.
并且返回答案,我想给你看看递归的最后一个例子,因为我们还要再看一遍,这是一个递归的经典案例,它可以追溯到13世纪。
s1 So for the fourth period, now we're into the 4 s 1 3d for potassium here. And what we notice when we get to the third element in 4s2 and the fourth period is 3d that we go 4 s 2 and then we're back to the 3 d's.
对于第四周期到现在我们来到钾的1,然后我们返回到,我们注意到当我们看到第三个元素,第四周期我们来到,然后我们返回到。
false It's going to return true if it's a PAIL-indrome and false if it's a PAL-indrome. And it says true. Now maybe you're bugged by this.
如果不是会问的话则是,返回的是真值,那么你可能会觉得这个很烦。
But it's a valuable thing. It says, in each case, I return some useful value from this procedure.
但是这就是变量,是在每个例子中,我从这个程序中返回了一些有用的值。
I can use that to return values, which I can then use elsewhere, which I did-- and if I just come back and highlight this-- inside of that computation.
我可以用它来返回值,然后我可以在别的地方使用这些返回值,正是我做的--如果我回过头来,在高亮一下这个--在这部分计算内部。
I don't have to go read what it printed out in the screen. This has returned a value that I can use. Because I could do a test to say, is this a return value? If it's not, I'll do something else with it. So the binding is still there, it simply doesn't print it out.
我不想读到屏幕中打印出来的这行字,程序返回过一个我能够使用的值,因为我可以做个小测试,来说明这是否是返回的值,如果不是,我可以做一些其它的事,而这个绑定依然在这儿,没有打印任何东西。
I'm going to print here the list if we go into it, and print of the when we're done and then just return that.
注意接下我来我要做的事,运行到这里时会打印列表,并且当处理完成后会打印返回的列表。
So I can similarly do this, which is going to look strange because it's going to give me the same value back out, but it actually did a slightly different thing.
我也可以通过类似的手段来达到这个目的,这看起来很奇怪,但是会返回相同的值,但是它的实现真的有点不同。
It says, well I'm going to print out first and last just so you can see it, and then I say, gee 2 if last minus first is less than 2, that is, if there's no more than two elements left in the list, then I can just check those two elements and return the answer.
然后它计算了尾点和开始点的差,如果小于2的话,也就是说数组中的元素小于等于,我对这两个元素进行比较,然后返回结果就可以了,否则的话,我们就去寻找中值点,注意它是怎么实现的,首先这个指向一个列表的开头。
应用推荐