Redian新闻
>
longest subarray with numbers arranged as a seq
avatar
longest subarray with numbers arranged as a seq# JobHunting - 待字闺中
T*l
1
没来得及拍照,跟大家汇报一些心得和要领
味道很赞,鸡胗口感脆嫩,嚼起来嘎嘣脆
原料:
1斤解冻后的鸡胗,两个青椒,一个小墨西哥尖儿辣椒,半个洋葱头
将鸡胗切成2-4毫米厚度片状,用GARLIC POWDER大蒜粉(多放一些),一勺半酱油,一
小勺盐,一勺孜然,外加切成大块状的洋葱头,放在一起腌制25分钟左右
腌好,用少许面户(湖)抓一下鸡胗(别忘了把之前的大块儿葱头翟出去),放热油锅
里过一下油,变色后捞出鸡胗备用
葱姜蒜呛锅,放入洋葱头,切碎的青椒以及辣椒,煸出香味儿后,放入鸡胗,爆火炒5
分钟,出锅!
avatar
c*j
2
这个表面简单的题Goolge MS 都考了啊。干脆发给新话题吧,还请大牛们指教啊
2个variation
MS 要求连续位置,考虑duplicate,DP, divide conquer, sort 貌似都有难度。。
Google 没有要求连续位置,简单不少,但是不让sort。。。。。又难回去了
check careercup:
http://www.careercup.com/question?id=11256218
Microsoft Interview Question about Algorithm asm on October 19, 2011
you have an array of integers, find the longest
subarray which consists of numbers that can be arranged in a sequence, e.g.:
a = {4,5,1,5,7,4,3,6,3,1,9}
max subarray = {5,7,4,3,6}
39
http://www.careercup.com/question?id=11070934
http://www.careercup.com/question?id=11066909
Google Interview Question for SDE in tests about Arrays learner on October
06, 2011
Given an int array which might contain duplicates, find the largest subset
of it which form a sequence.
Eg. {1,6,10,4,7,9,5}
then ans is 4,5,6,7
Sorting is an obvious solution. Can this be done in O(n) time
32
[Full Interview Report]
Country: -
Interview Type: Phone Interview
Tags: Google » Arrays » SDE in test Question #11070934 (Report
Dup) | Edit
| History
avatar
t*s
3
“肫”
没有猪肉就清真了???你所有的器具都从新的开始完全没有接触过吗?
avatar
s*7
5
bless.
相关阅读
logo
联系我们隐私协议©2024 redian.news
Redian新闻
Redian.news刊载任何文章,不代表同意其说法或描述,仅为提供更多信息,也不构成任何建议。文章信息的合法性及真实性由其作者负责,与Redian.news及其运营公司无关。欢迎投稿,如发现稿件侵权,或作者不愿在本网发表文章,请版权拥有者通知本网处理。