由买买提看人间百态

topics

全部话题 - 话题: obesepig
(共0页)
d*****r
发帖数: 39446
1
【此篇文章是由自动发信系统所张贴】
obesepig 已经成为本俱乐部的正式成员, 特此通知.
m*****n
发帖数: 5245
2
来自主题: JobHunting版 - [合集] 一道CS面试题
☆─────────────────────────────────────☆
HansLee (迅潇麒麟) 于 (Tue Aug 28 01:45:42 2007) 提到:
一个数组中存放N个整数,如何找到出现次数最多的一个数(即众数),要求用O(N)的
复杂度,而且不能用Hashing(内存和时间都是O(N))。
大家有何见教? (我有一个初步答案,但不一定最佳,改天给出)
☆─────────────────────────────────────☆
obesepig (Obesepig) 于 (Tue Aug 28 02:08:34 2007) 提到:
If space complexity is O(N), then the question is too trivial(Using a
hashtable).
If the space complexity is O(1), it's kind of tricky and I guess probably
your friend is asked to solve the following questi
v*********n
发帖数: 3983
3
真是一群小猫小狗啊
[在 obesepig (Obesepig) 的大作中提到:]
:我家儿子两岁多的时候也被咬过,脸上一圈完整的印子,过了几个月才消。他也抓过
别人咬过别人很多次。所以,别放在心上,像楼上的说的,问问老师怎么处理的,make
:sure they know u‘re concerned,然后告诉你小孩大声说:
:...........
m*********k
发帖数: 10521
4
来自主题: _mitbbscheck版 - 2013.07.04首页文章奖励
本次统计截止时间为:2013-07-04 02:00:00 (美东时间)
成功奖励 20 伪币的用户: accos, aiesec, armorz, chainshore, Chenlizi,
chensinan, coolsheng, cynic, dayanggou, dontlaugh, fengse8634, flyfox,
genpichong, guoke, HeiGuGu, hllh, I66, icq9999, IcyLi, ilu, imh, ironboy,
Irrational, jn74612001, kickok, Lasiac, lkcs, manwu, mayoutu, mbright, moha,
neosunrise, nova888, obesepig, oldgun, qiaka, qingxi, qwxqwsean, renzaimg,
sammix, waiting140, WillyBass, xiaan, xiaan, xiaocaomama, YoYoHa, yueniang,
zhongdao
奖励版面:(Animals)20伪币成功
... 阅读全帖
o******1
发帖数: 275
5
来自主题: JobHunting版 - 补充一下amazon的感受
for all successfully company, they have special technology advantage which
is well established, those advantage won't directly convert into benefits
for employees. Amazon ' engineering infrastructure seems pretty impressive
in large online deployment, but what really made amazon different from
competitor is their business model.
I am not sure amazon is really outstanding in terms of technology,
employees mostly care how company treat their employees, and prospects of
the company. In terms... 阅读全帖
(共0页)