Notice what it says. I'm going to pass in 1 a string, call it s, binds it locally, and it says the following.
然后看接下来的内容,接下来说的是如果这个字符串的长度等于,那么我就成功了。
Don't worry. I'm sure you will pass the next test.
别担心。我相信下次你肯定能通过的。
So the exceptions are useful when you want to have the ability to say, I expect in general this kind of behavior, but I do know there are some other things that might happen and here's what I'd like to do in each one of those cases. But I do want to make sure that I don't let a value that I'm not expecting pass through.
所以当你希望有能力说,我希望一般是这样的行为,异常是很有用的,但是我明白还有一些其它的情况可能发生,我希望对每一种情况都这么做,但是我跟希望能保证,没有让一个预期之外的情况漏过去。
And in this case, we go from 8 to 4 to 2 to 1 three times and then on each iteration of this algorithm, each pass across the board I'm touching N numbers, so that means I'm doing N things, log N times.
在这个例子中,我们从8得到4,到2,再到1,是3次,在这个算法的每次迭代中,每一趟我都会操作N个数,也就是所我每次要做N步操作,一共要做,log,N,次。
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.
这不仅仅是个列表,它是怎么来做的?,流程是:如果我想要返回,一些已经在笛卡尔模式下建好的值,好,再说一遍,我首先要传入一个,指向实例的指针,也就是,然后我会返回一个,由开括号,闭括号,中间的一个逗号,以及提前转换为字符串格式的。
应用推荐