i*s
2 楼
本人的485递交上去快5个月了,到现在还是一点消息都没有。求大家祝福!
通过后,一定好好写帖子总结自己的经验给大家。
谢谢!!!
通过后,一定好好写帖子总结自己的经验给大家。
谢谢!!!
m*h
3 楼
比领薪水的还卖力
h*r
4 楼
用verizon 4g lte, 看pps tv太爽了。
f*g
5 楼
1. Quick sort.
Since the quick sort is randomization algorithm, the running time varies
each time. But the worst case scenario is O(nlogn)
2. Min-Max Heap.
it takes O(logn) time.
Since the quick sort is randomization algorithm, the running time varies
each time. But the worst case scenario is O(nlogn)
2. Min-Max Heap.
it takes O(logn) time.
m*h
7 楼
山姆大叔欠破狗一大笔工钱
N*n
8 楼
电池怎么搞?随时充电,不烫么?
A*9
14 楼
Bless!
c*h
16 楼
比起一台破电脑好处在哪里?
s*M
19 楼
最开始几张
还以为打算玩平衡木走钢丝呢
还叼的是中间。。。
还以为打算玩平衡木走钢丝呢
还叼的是中间。。。
y*g
23 楼
汗,你不说明一下,我还以为忠勇公在学海狸鼠修水坝呢。。。。。。
f*g
25 楼
Yes. true.. Worse case is N^2 Thanks:S
Check the following paper about min-max heap structure.
http://www.cs.otago.ac.nz/staffpriv/mike/Papers/MinMaxHeaps/MinMaxHeaps.pdf
【在 l*****v 的大作中提到】
: Quick sort worst case is n^2
: how to use min-max heap?
Check the following paper about min-max heap structure.
http://www.cs.otago.ac.nz/staffpriv/mike/Papers/MinMaxHeaps/MinMaxHeaps.pdf
【在 l*****v 的大作中提到】
: Quick sort worst case is n^2
: how to use min-max heap?
c*g
27 楼
偶咋觉得破狗这是去堵塞河道来着...
l*v
29 楼
to be more specific. initialize the sentinal to be 0, scan array count how
many equal, larger or less than 0, if larger count is much more than less +
equal, continue with (0 + 2^32)/2...
Until you reach the balanced integer.
Do the final round of scan to find integer which occurs in the array and are
just larger and less than balanced integer. They are the median.
You need take care of edge case.
【在 l*****v 的大作中提到】
: Binary search of integer range.
: Running time in worst case is O(32*n)= O(n)
many equal, larger or less than 0, if larger count is much more than less +
equal, continue with (0 + 2^32)/2...
Until you reach the balanced integer.
Do the final round of scan to find integer which occurs in the array and are
just larger and less than balanced integer. They are the median.
You need take care of edge case.
【在 l*****v 的大作中提到】
: Binary search of integer range.
: Running time in worst case is O(32*n)= O(n)
f*g
33 楼
If these ints are distributed in a small range, the bucket sort will work :S
+
are
【在 l*****v 的大作中提到】
: to be more specific. initialize the sentinal to be 0, scan array count how
: many equal, larger or less than 0, if larger count is much more than less +
: equal, continue with (0 + 2^32)/2...
: Until you reach the balanced integer.
: Do the final round of scan to find integer which occurs in the array and are
: just larger and less than balanced integer. They are the median.
: You need take care of edge case.
+
are
【在 l*****v 的大作中提到】
: to be more specific. initialize the sentinal to be 0, scan array count how
: many equal, larger or less than 0, if larger count is much more than less +
: equal, continue with (0 + 2^32)/2...
: Until you reach the balanced integer.
: Do the final round of scan to find integer which occurs in the array and are
: just larger and less than balanced integer. They are the median.
: You need take care of edge case.
l*y
34 楼
Big Bless
s*t
37 楼
for the min-max heap. I don't think it is easy to implement during interview
.
However, maintain a min heap and a max heap will be easier, but the running
time will be nlog(n), since inserting an item into a heap is log(n). I guess
it is more suitable for streaming data.
【在 f****g 的大作中提到】
: 1. Quick sort.
: Since the quick sort is randomization algorithm, the running time varies
: each time. But the worst case scenario is O(nlogn)
: 2. Min-Max Heap.
: it takes O(logn) time.
.
However, maintain a min heap and a max heap will be easier, but the running
time will be nlog(n), since inserting an item into a heap is log(n). I guess
it is more suitable for streaming data.
【在 f****g 的大作中提到】
: 1. Quick sort.
: Since the quick sort is randomization algorithm, the running time varies
: each time. But the worst case scenario is O(nlogn)
: 2. Min-Max Heap.
: it takes O(logn) time.
x*n
38 楼
bless!
y*g
39 楼
晚上海狸鼠回来一看,家没了,大哭。。。。。。
b*e
41 楼
there is a textbook classic of "median of medians of 5", which finds the
median in O(n) worst case time but have no practical use;
practical solution is to use quick-selection, based on the quicksort
partition idea and is average O(n), as mentioned upstairs. Worse case can
typically be avoided by some techniques of choosing the partition value,
such as the "median of three"
search trees, sorting, heaps - these are mostly O(n lg n) solutions and very
practical ones too.
For integers, don't forget there are some linear sorting algorithms, so you
may do better than the general methods.
median in O(n) worst case time but have no practical use;
practical solution is to use quick-selection, based on the quicksort
partition idea and is average O(n), as mentioned upstairs. Worse case can
typically be avoided by some techniques of choosing the partition value,
such as the "median of three"
search trees, sorting, heaps - these are mostly O(n lg n) solutions and very
practical ones too.
For integers, don't forget there are some linear sorting algorithms, so you
may do better than the general methods.
A*d
42 楼
Bless
i*p
43 楼
哈哈。破狗力气真大。
s*t
45 楼
some linear sorting algorithms for integers? Could you please list some?
very
you
【在 b*****e 的大作中提到】
: there is a textbook classic of "median of medians of 5", which finds the
: median in O(n) worst case time but have no practical use;
: practical solution is to use quick-selection, based on the quicksort
: partition idea and is average O(n), as mentioned upstairs. Worse case can
: typically be avoided by some techniques of choosing the partition value,
: such as the "median of three"
: search trees, sorting, heaps - these are mostly O(n lg n) solutions and very
: practical ones too.
: For integers, don't forget there are some linear sorting algorithms, so you
: may do better than the general methods.
very
you
【在 b*****e 的大作中提到】
: there is a textbook classic of "median of medians of 5", which finds the
: median in O(n) worst case time but have no practical use;
: practical solution is to use quick-selection, based on the quicksort
: partition idea and is average O(n), as mentioned upstairs. Worse case can
: typically be avoided by some techniques of choosing the partition value,
: such as the "median of three"
: search trees, sorting, heaps - these are mostly O(n lg n) solutions and very
: practical ones too.
: For integers, don't forget there are some linear sorting algorithms, so you
: may do better than the general methods.
s*l
46 楼
bless ...
m*h
47 楼
忠勇公容易么
b*e
49 楼
check out radix sort
g*5
51 楼
忠勇公到底为了什么?
r*l
53 楼
count how
less +
and are
good idea, you can scan once to find min and max first
【在 l*****v 的大作中提到】
: to be more specific. initialize the sentinal to be 0, scan array count how
: many equal, larger or less than 0, if larger count is much more than less +
: equal, continue with (0 + 2^32)/2...
: Until you reach the balanced integer.
: Do the final round of scan to find integer which occurs in the array and are
: just larger and less than balanced integer. They are the median.
: You need take care of edge case.
q*p
55 楼
LOL
Z*e
56 楼
好奇有多少旅馆的电视有hdmi?
f*g
57 楼
Sorting algorithms can be categorized as comparison-based and not comparison-
based ones.
For the comparison-based algorithms, the best performance is O(nlogn).
and non-comparison-based ones could be achieved in linear-time. But it
uses space to trade off time.
【在 s*******t 的大作中提到】
: some linear sorting algorithms for integers? Could you please list some?
:
: very
: you
based ones.
For the comparison-based algorithms, the best performance is O(nlogn).
and non-comparison-based ones could be achieved in linear-time. But it
uses space to trade off time.
【在 s*******t 的大作中提到】
: some linear sorting algorithms for integers? Could you please list some?
:
: very
: you
j*2
61 楼
BLESSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSS
SSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSS!!!!!!!!
!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
SSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSS!!!!!!!!
!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
g*5
65 楼
以前最爱狗小乐
现在最喜忠勇公
以后养狗是选小乐还是勇公,委实难决!
现在最喜忠勇公
以后养狗是选小乐还是勇公,委实难决!
i*s
67 楼
谢谢大家的祝福。
h*n
68 楼
狗界的活雷锋啊~~~
y*g
70 楼
最后忠勇公有没有征服那个目标?还是发现目标定的太大了?
b*y
72 楼
别看破狗个子小,力气可真不小。
t*6
73 楼
bless!
Q*A
76 楼
天哪,破狗应该算是我见过最快乐的狗了,每天都玩的很high,每天都一副甩开了撒欢
的样子!!!-----幸福的狗生啊
的样子!!!-----幸福的狗生啊
a*t
78 楼
这个应该挺重吧~~ 破狗吃高蛋白的,就是不一样 哈哈
t*7
79 楼
祝福!
z*o
81 楼
big bless
a*y
85 楼
太搞笑了
每次看破狗贴,都觉得它简直就是从卡通片里跑出来的!!
每次看破狗贴,都觉得它简直就是从卡通片里跑出来的!!
x*8
87 楼
这孩子心智有问题了。
看34-37秒,好像要强奸木头似的。
见过青春期的小狗,经常拿绒毛玩具放胯下面性骚扰。
看34-37秒,好像要强奸木头似的。
见过青春期的小狗,经常拿绒毛玩具放胯下面性骚扰。
b*n
89 楼
破狗真辛苦啊,一看就是苦出身,勤劳的劳苦大众
相关阅读
啥时候会有ac connection的电视盒或电视棒呢Best Buy 的LG Tribute 带回国可以用吗?这么多讨论到底什么设备可以无线连电视啊今天下单了tabpro 8.4Bestbuy里面fire stick很多,可以price match staple516综合电视挂了?我该从T家转到V家吗?这里有不少1+的托吗?有人说它不好,就会fire tv stick不能像chromcast那样用手机控制有关注NEXUS 6的吗?你们都那里买1+的啊乐视盒子怎么从3.0刷回1.5Lumia Denim这个月没戏了?微软大杀器为什么老有人拿火柴棍这种烂货跟海美迪比?不可理喻嘛!求救:fire tv stick不会用n5能不能从lollipop降到kitkat用盒子棒子的童鞋,小心别在小孩面前浏览电影目录安卓盒子上应该装些啥?firetv stick question