当杯子小,像你的祖母的中国茶杯,每杯水一舀咖啡是必要的。
When cups were smaller, like your grandmother's China tea cup, only one scoop per cup was needed.
这个杯子有个小缺口。
这是一个黑暗的小故事,讲的是有个男人发现了一个魔法杯,得知如果他对着杯子哭泣,掉进杯里的眼泪会变成珍珠。
It was a dark little tale about a man who found a magic cup and learned that if he wept into the cup, his tears turned into pearls.
And so this begs the question, even in the context of these cups, how can we possibly do better if at the end of the day in order to figure out if two cups or if two people or if two ints inside of an array are bigger or smaller than one another it feels like we have to do this comparison work anyway.
这样就回避了问题的实质,从这些杯子的相互关系来看,我们怎样才能更有效地,找出序列中比其他元素,都大或都小的两个杯子,两个人,两个数,看起来我们无论如何都得,做比较的工作。
应用推荐