昨天晚上在一家快餐店里吃晚餐

旁边一位亚裔中年人问一位大约十一二岁的娃：如果有一个 linked list里有个loop，要查出来，o(n)time complexity, o(1) space complexity, 要怎么做啊？

娃想好久没回答。

中年人： 想想tortoise and hare的故事啊

娃说，哦，我明白了。

笑死我了 ........

--------------------------------------

另一个新闻是关于Google， G第三个季度雇了6450个新职员，大部分都是new grad，在云。

Porat said headcount grew “unusually high” in the third quarter as the company added 6,450 new employees. She explained the high rate came from Cloud’s hiring strategy and was also due to new college graduates.

Pichai said on the call that the Cloud unit could become the greatest benefactor of its recently-announced quantum computing milestone.

所有跟帖： 

• 子坛的那个谁，赶快出来坦白。。 -borisg- ♂ (0 bytes) () 10/29/2019 postreply 08:45:00

• 肯定是紫檀的啊 ..... -backyardfun- ♀ (0 bytes) () 10/29/2019 postreply 08:51:53

• 牛啊 才11歲 -violinpiano- ♂ (205 bytes) () 10/29/2019 postreply 08:47:54

• 我比较不看好早推编程的。紫檀有一例子 -12度圆缺- ♂ (136 bytes) () 10/29/2019 postreply 08:54:39

• 编程再进一步，用functional programming，就对了 -tibuko- ♂ (177 bytes) () 10/29/2019 postreply 09:06:07

• 怎么做的不重要，笑点在竞赛娃都喜欢快餐店 -backyardfun- ♀ (122 bytes) () 10/29/2019 postreply 08:55:06

• 谢谢 -Bin123- ♂ (0 bytes) () 10/29/2019 postreply 09:11:46

• 是你和娃啊？LOL 不好意思 -backyardfun- ♀ (0 bytes) () 10/29/2019 postreply 09:14:23