At that stage we can merge these, and then take this down, do the division merge and bring them back up.
在那里做一次分解,做到这步时,我们可以把这些进行合并,然后把这个拿下来,做分解合并过程后再把它们拿回去。
and you can just take it away and walk around the market. And it's only 5 pounds.
你可以把它打包带走,然后逛逛市集。这只要五英镑。
if we think about electronegativity as a periodic trend we can just draw our nice periodic table here, and let's separate it into quadrants.
如果我们来思考一下电负性的周期性规律,我们可以把我们漂亮的周期表画在这,然后把它分成四个象限。
Wimsatt has his little joke about drinking a pint of beer, taking a walk. So the New Criticism just isn't interested in those sorts of spontaneous overflow.
文萨特也开玩笑似的把这比喻成喝完一品脱啤酒,然后散散步,所以我说过了,新批评派对这东西不感兴趣。
In the second case, I found in the next smallest element and moved here, taking what was there and moving it on, in this case I would swap the 4 and the 8, and in next case I wouldn't have to do anything.
在第二次遍历中,我找到了,第二小的元素,把它移到这里,把这里原来的元素移到哪里,在这一次遍历中,我会把8和4交换,然后一次遍历,不会做任何事情。
We'll come full circle later in the semester and actually begin to create things just as animated again.
我们这学期要把这些都学一遍,然后开始创作类似动画的东西。
You can take this vector, multiply it by one number, take that vector, multiply it by another number, add the two of them.
比如将这个矢量,乘上一个数,然后将另一个矢量,乘上另外一个数,把这两个矢量相加
And the guys said, "Well, you know, The rooster works very hard " The rooster has sex dozens of times a day" " And she said, "Well, be sure to tell that to the president" The story goes, the president went around, the guy tells the story to the president The president asks the man, "Huh Has sex dozens of times each day ?" Same hen every time?"
那人回答说,“那只公鸡很卖力的,每天交配好几十次“,她就说“确保把这告诉总统“,然后总统走过来,那人也跟总统说了这事,总统问他,“每天交配几十次,是和同一只母鸡吗“
We put the magnesium 2 plus here, and then we put the oxygen here, O 2 minus, and we know that this gives us our R zero, right?
我们把Mg2+放这,然后O2-放这,我们都知道这给我们的是R0,对么?
So what would I want to do? I'd like to somehow walk down each of the digits one at a time and add them up. Ah, that's a looping mechanism, right? I need to have some way of walking through them.
去取这个数的,每个数字然后把他们加起来,啊,这是个循环机制对不对?,我得找到一个遍历它们的方法,一种简单的方法可能。
In that case point p 1 doesn't correspond to this point, it actually corresponds to the point of radius 2 and angle 1, which is about here.
基本上也就是说这是第一个点1,这是第二个点,把它们的值加到一起,然后我就得到了目标点,好,这听起来挺不错的。
And then, three: if not, reduce to a smaller problem, and repeat.
把问题缩减成一个更小的问题,然后重复,恩,这看起来很清晰了,是的。
Delete those lines of code and move them up to the top and problem solved.
把这几行代码删除,然后把它们放到,前面去,问题就解决了。
Hmm. Well, wait a minute. If I want to sort a list, I'll take one element, I've got to look at probably a lot of the other elements in the list in order to decide where it goes. And that suggests it's going to depend on how long the list is.
我会取一个元素,然后去查看列表,来决定要把那个元素放到哪里,这就意味着它依赖于列表的长度,对,这没什么说服力,但是事实上。
x and get the values of x and y attached to this thing and return them to me.
和y值然后把它们返回给我,It’s,going,to,go,off,这就是我想要的东西,我想要我的类里面有一些方法。
s2 So, I'm passing in the first character in s2, I'm making it uppercase and then I'm putting it back so casually speaking this is just capitalizing the first letter of whatever word the user typed in to s2.
那么,我把第一个字符传递给,我把它转换成大写的,然后存下来,简单说,这就是把用户输入s2中的单词,的第一个字母转换成大写的。
But then, I combine i times Ax with i times Bx, because that's the vector parallel to i, with the length Ax.
然后我把 i ? Ax 和 i ? Bx 加起来,因为这是平行于 i,模长为 Ax 的矢量
I then create a third variable called "z," add those two digits together, store the sum.
然后我声明了一个叫做“z“的变量“,把这两个数字加起来,把他们的总数存起来。
I then store in it A. This makes a copy.
然后把它存储在A中,这就是一个复制。
Another way of saying it is, I've actually said, what did I use there, and , It's basically saying there is the first point, there's the second point, add them together and I get that point.
我要去做的是-对不起,再运行一次-好,你可以看到我已经把,这两个点的坐标值加到一块儿了,然后返回了r的值,我会让大家看到我们,实际上得到的是什么,这看起来不错,好,我做了正确的操作。
If I want to move this stack here, I'm going to take a stack of size n minus 1 move it to the spare spot, now I can move the base disk over, and then I'm going to move that stack of size n minus 1 to there. That's literally what I did, OK?
如果我想移动这些圆盘,我先把从n-1个圆盘1,移动到多余的柱子上去,这样我就能把最底下的圆盘放到这儿了,然后再把从n-1个圆盘放到这儿来,这就是确切的我怎么做的对不对?
应用推荐