z********i
发帖数: 568 | 1 /* find the first missing postivie integer in array A with n elements
return x if one postive integer in [1..n] is missing;
return 0 otherwise;
*/
int findFirstMissingPositiveInteger(int A[], int n){
int x,i,val,index;
/* rearrange the input array A such that
B[i]=i+1 if i+1 exist in array A, or
B[i]=A[i] if i+1 does not exist in array A
where B is the array rearraged from A.
*/
for(i=0;i
/* put A[i] in A[A[i]-1] if 1<=A[i]<=n && A[i]!=i+1 */
val=A[i... 阅读全帖 |
|
z********i
发帖数: 568 | 2 /* find the first missing postivie integer in array A with n elements
return x if one postive integer in [1..n] is missing;
return 0 otherwise;
*/
int findFirstMissingPositiveInteger(int A[], int n){
int x,i,val,index;
/* rearrange the input array A such that
B[i]=i+1 if i+1 exist in array A, or
B[i]=A[i] if i+1 does not exist in array A
where B is the array rearraged from A.
*/
for(i=0;i
/* put A[i] in A[A[i]-1] if 1<=A[i]<=n && A[i]!=i+1 */
val=A[i... 阅读全帖 |
|
f*****7
发帖数: 92 | 3 lz的意思是，算出最优merge时间。
那就是，可以rearrange merge的顺序，不一定merge相邻的
所以原则就是，总是merge最短的两个。
lz也说，经典题嘛。那就套huffman编码的算法了。 |
|
b***m
发帖数: 5987 | 4 随便写点儿吧。
第一个，烙印，Senior Test Lead，上来先闲聊，然后做题。今天这个烙印比较狠，上
来就让我设计内存分配，并且要我找寻优化方案来尽量减少内存的浪费，速度还要快。
方案设计出来后，用C++来实现。幸亏我前一阵苦读了一下内存分配的算法，否则今天
直接就挂那儿了。
第二个，烙印，Principal Test Manager，闲聊后做题。传入两个singly linked list
，找出它们的第一个common node。不用extra space怎么解？
第三个，白人，Principal SDET，先带我去吃饭，看看café里面只有印度餐算是能吃
，顺道搞了一罐红牛给下午提神。吃饭期间问了很多行为问题，特别是为什么多年做
development现在面testing，然后回办公室做题。先是coding，给你N张牌，怎么得出
有多少组合结果是15（J、Q、K都算作10，A算作1）？然后是纯测试brainstorm题，一
个冗余数据库系统，比如有1个primary server，4个slave server，所有slave server
上的数据都是从primary s... 阅读全帖 |
|
H**********y
发帖数: 7928 | 5 牛！
随便写点儿吧。
第一个，烙印，Senior Test Lead，上来先闲聊，然后做题。今天这个烙印比较狠，上
来就让我设计内存分配，并且要我找寻优化方案来尽量减少内存的浪费，速度还要快。
方案设计出来后，用C++来实现。幸亏我前一阵苦读了一下内存分配的算法，否则今天
直接就挂那儿了。
第二个，烙印，Principal Test Manager，闲聊后做题。传入两个singly linked list
，找出它们的第一个common node。不用extra space怎么解？
第三个，白人，Principal SDET，先带我去吃饭，看看café里面只有印度餐算是能吃
，顺道搞了一罐红牛给下午提神。吃饭期间问了很多行为问题，特别是为什么多年做
development现在面testing，然后回办公室做题。先是coding，给你N张牌，怎么得出
有多少组合结果是15（J、Q、K都算作10，A算作1）？然后是纯测试brainstorm题，一
个冗余数据库系统，比如有1个primary server，4个slave server，所有slave server
上的数据都是从prima... 阅读全帖 |
|
c********t
发帖数: 5706 | 6 是不是我改java改的有问题
bitmap判断那句改成下面的是不是对的？
if (((1 << i) & bitmap) != 0) {
continue;
}
static void rearrange(ArrayList list) {
int bitmap = 0; // "O(1)" space for length < (1 << 32)
int k = list.size() / 2;
int n = list.size();
for (int i = 0; get_index(i) < k; ++i) {
int cur = get_index(i);
if (((1 << i) & bitmap) != 0) {
continue;
}
int next = cur * 2;
String tmp = list.get(cur);
while (true) {
if... 阅读全帖 |
|
o***d
发帖数: 313 | 7 我怎么觉得是maxheap阿?
这个问题似乎是这样的:
如果每秒钟来1000个股票的现在的价格,要求显示今天股票涨幅最多的5支.
说个错误的做法:
第一次来数据的时候,把1000个股票的前5个找到,放到sorted array里.
然后,下次再来的1000个股票,okay,挨个算涨幅,然后跟现在的5支挨个比较?然后再怎么
维护这个sorted array? time complexity太高了吧?每次要insert and then rearrang
ement.
正确的做法是用maxheap??? |
|
L****Y
发帖数: 355 | 8 来自主题: JobHunting版 - 一道G面经 From the set of natural integer numbers
Let x = 1234 = {1, 2, 3, 4}
Let y = 2410 = {2, 4, 1, 0}
Write an algorithm to compute the rearrangement of x that is closest to y
but still greater than y. Both x and y have the same number of digits.
So in the example above, the answer would be { 2, 4, 1, 3 } = 2413 which is
greater than y = 2410 and closer than any other arrangements of x.
And whats the time complexity of this algorithm?
Any efficient algorithm？ |
|
h******6
发帖数: 2697 | 9
.
computation.
嗯我也发现这个问题了 这个不光是architecture的问题也有算法的问题 有时候并行算
法会rearrange recurrences所以浮点结果会跟串行的不一样 不过NVIDIA也在改进他们
浮点的精度 Fermi改进蛮大的 不知道Kepler怎么样 |
|
s*********e
发帖数: 197 | 10 为了积攒人品RP，为了H1B顺利，为了有更好的工作，为了有一个更好的将来，开始追
leetcode，并写下自己的做题感受和大家分享，更是作为自己的督促。做题目的原则如
下：
1) Optimized Algorithms to pass the "large" test.
2) Proper abstraction
3) Write the code whose correctness is *easy* to reason about.
4) Favor readability over efficiency without compromising item 1).
5) Rearrangement and tweaking
我试图对自己进行训练的目标就是写完代码，能够确认自己写对了。目前为止，我有一
些小小的心得，会贯穿在下面和以后的文章中。第一，循环不变式；第二，优化控制流
；第三，适度抽象，语义精确的子函数。
抛砖引玉，献上第一弹：Text Justification. 为了更好的可读性，想用一种类C的伪
代码并尽量省略一些类型声明。很多叙述可能比较罗嗦，见谅。
首先要考虑的... 阅读全帖 |
|
D*********Y
发帖数: 3382 | 11 要是叫我rearrange时间呢？有没有法子让它不理我了，又显得professional |
|
f*****2
发帖数: 141 | 12 2.1 Suppose we have an array a1, a2, ..., an, b1, b2, ..., bn. Implement an
algorithm to change this array to a1, b1, a2, b2, ..., an, bn
答案给的是O（n*n）和O（nlgn）的解，分治法还得用recursion，这题并没有说不能用
额外的buffer空间，那不可以用最简单的方式弄个O（n）的解吗？
另外像这样的题没说数组类型，是不是面试的时候可以问是哪种类型？
假设是int型，这样写行不行：
int *rearrange(int *arr, int N)
{
if (arr == NULL)
return NULL;
int new_arr[2*N];
for (int i = 0; i < N; i++)
{
new_arr[2*i] = arr[i];
new_arr[2*i+1] = arr[N+i];
}
arr ... 阅读全帖 |
|
l*n
发帖数: 529 | 13 类似，但是有区别。first missing positive里面可以简单跳过一些element，但是本
题如果出现“环”之后，没有办法判断下一个element是否被rearrange过，所以会需要
额外的空间进行标记才行。 |
|
|
s**x
发帖数: 7506 | 15 差不多，那个decrease unique count 的地方也应该check == 2 的case I think.
You can Rearrange code a little bit, to avoid duplicated code. |
|
b*********7
发帖数: 87 | 16 下面的Loop 怎么rearrange去掉data dependency?
for i=1:n
for j=1:m
B(i,j)=B(j+1,i-1)+S
end
end
for i=1:n
for j=1:m
B(i,j)=B(i-1,j)+B(i+1,j)+B(i,j+1)
end
end
for i=1:n
for j=1:m
S=0;
for k=1:p
S=S+A(i,k)+B(k,j)
end
C(i,j)=S
end
end |
|
m*****n
发帖数: 204 | 17
The following is an O(nlgn) solution for string of size n.
It maintains a heap for eligible chars, preferring longer streams.
Ineligible chars are maintained in a candidate queue, and added back
to the working queue when their position constraint is removed.
public class MinDistance {
public String rearrange(String source, int distance) {
// TODO Check params.
// WorkingQueue of eligible streams. Longest stream at head,
// but BackupStream at tail.
PriorityQueue阅读全帖 |
|
l******a
发帖数: 14 | 18 Sort the mouse for left to right.
Add mouse one at a time, keep a current time length that all included mouses
can run to holes. And keep the current mapping.
When adding new mouse, if min time hole for that mouse is not mapped, added,
move on.
If no empty hole on left for existing included mouses, pick the min hole
from not mapped hole, added and move on.
If min hole is occupied, and there are empty holes on the left, pick the
closest empty hole, check if the max time if move all existing mouse... 阅读全帖 |
|
发帖数: 1 | 19 楼主fresh ms
今天刚面的g
四轮，第一二轮每轮两题，都是直接给出最优解然后代码写完并且跑了两三个test
case
第三轮只做了一题，题本身不复杂，一个一米长的sidewalk，假设是0-1,设雨滴的宽度
固定为0.01米，每次下雨的位置随机，精度是double，问多少滴雨才能使整个sidewalk
变湿。模拟整个过程。只是面试官一直聊一直聊，一会又问我这个雨滴数的期望是多数
，一会又和我聊什么概率分布什么的，我一直想赶快写赶快写让他再出一题，。。最后
也只写了一题
第四轮，也是一题，也是一个面经题吧，给一个List l和一个number n，让
rearrange这些string，使得每一个string之后至少n个位置，才能出现重复的string。
如果这种结果不止一个，返回任意一个
例如，List = {"a","a","b","b","c","c“},n = 3
return {a,b,c,a,b,c}
这题我面经看到过类似的，应该说也是几分钟就可以写出来了。可能是因为有shadow，
要演示给shadow看？ 总之interviewer让... 阅读全帖 |
|
c*****m
发帖数: 271 | 20 楼主好牛逼，到这程序offer应该有了吧！祝福
之前也看过相似的面经题，当时没想出来解法。看了你的解法，才知道核心思想应该是
greedy吧？
greedy选择下一次排的word的条件是：
1.word余下出现次数最多
2.word满足的位置满足要求，即前面n位置没有相同的word。
因为有heap，你这个解法的复杂度是O(nlogn)。
我想到的和楼上有一位提到的相似，应该是O(n)的：
1. filter: 如果某个word出现大于ceil(N/n)次，那么就不能排，返回异常；否则就可
以排
2. 将N分成ceil(N/n)个sections,从出现次数最大的word开始，比如('a', 3次)，每个
section中放一个word，比如'a'放在１，２，３个section中；如果section满了，就放
到后面的section中去
3. 将所有的section连接起来，得到结果。
写了段python的，求拍
def rearrange(self, word_list, n):
#count
word_counter = collection... 阅读全帖 |
|
o*q
发帖数: 630 | 21 Google
Show problem tags Hide locked problems
#
Title
Acceptance
Difficulty
Frequency
66 Plus One 35.4% Easy
146 LRU Cache 15.8% Hard
200 Number of Islands 29.7% Medium
288 Unique Word Abbreviation 15.7% Easy
163 Missing Ranges 30.3% Medium
56 Merge Intervals 26.7% Hard
228 Summary Ranges 26.0% Medium
308 Range Sum Query 2D - Mutable 20.8% Hard
279 Perfect Squares 34.1% Medium
388 L... 阅读全帖 |
|
o*q
发帖数: 630 | 22 # Title Editorial Acceptance Difficulty Frequency
1
Two Sum 28.3% Easy
292
Nim Game 54.4% Easy
344
Reverse String 57.3% Easy
136
Single Number 52.2% Easy
2
Add Two Numbers 25.6% Medium
371
Sum of Two Integers 51.6% Easy
4
Median of Two Sorted Arrays
20.4% Hard
6
ZigZag Conversion 25.6% Easy
13
Roman to Integer 42.7% Easy
237
... 阅读全帖 |
|
uj
发帖数: 324 | 23 这题是rearrange-string-k-distance-apart变体
烙印有病啊。最大和最小根本就不是一个套路 |
|
发帖数: 1 | 24 Suppose we are given N different types of stickers. Each sticker type has a
word on it, for example, we could have 4 sticker types that say “math”, “
science”, “english”, and “history” respectively. You would like to
spell out the target word “learning” by cutting out individual letters
from your collection of stickers and rearranging them. If you are allowed to
use more than one sticker of a given type to form the target word, what is
the minimum number of total stickers you will require? In th... 阅读全帖 |
|
W******l
发帖数: 430 | 25 A, but rearrange ur desk and bookshelf |
|
j***b
发帖数: 5901 | 26 Crawspace is the cheapest, not slab.
Plumbing is difficult to rearrange on slab, but I don't see why re-wiring is especially difficult, since it all goes through the attic. |
|
x******t
发帖数: 3911 | 27 Rearrange the furniture, re-decorate, or remodel the house will help. |
|
b*******r
发帖数: 138 | 28 谢谢楼上的，这2天做了些research，一个权威的plumber也是这样解释的，属于正常现
象。
What is happening is very normal.
Plastic expands and rubs against wood. This sort of thing has been going on
for decades without an issue.
A Furnace will have simalar issues. The pipes warm up, and then they cool.
As they cool things slip back into postion again.
A home that faces the South in the Summer, will get taller on the sunny side
. In the evening, after the sun goes down, the house contracts on that side,
causing all sorts of sounds as ... 阅读全帖 |
|
b*******r
发帖数: 138 | 29 谢谢楼上的，这2天做了些research，一个权威的plumber也是这样解释的，属于正常现
象。
What is happening is very normal.
Plastic expands and rubs against wood. This sort of thing has been going on
for decades without an issue.
A Furnace will have simalar issues. The pipes warm up, and then they cool.
As they cool things slip back into postion again.
A home that faces the South in the Summer, will get taller on the sunny side
. In the evening, after the sun goes down, the house contracts on that side,
causing all sorts of sounds as ... 阅读全帖 |
|
j****d
发帖数: 123 | 30 对一部分在中国的肺癌患者,这是个极好的消息
新药 XALKORI (crizotinib) 药试在, 北京,南京,上海,广州, 已经开始.
免费!
这是临床二期 [无对照组]: 人人得药;
[不是临床三期: 对照组得安慰剂/对照药/老药]
条件: ALK 基因重组活检阳性
FISH biopsy ALK gene rearrangement positive (translocation or inversion) to
qualify. Contact me or NIH site if you need more information.
美国价格$9,500/月[保险公司价] |
|
j****d
发帖数: 123 | 31 对一部分在中国的肺癌患者,这是个极好的消息
新药 XALKORI (crizotinib) 药试在, 北京,南京,上海,广州, 已经开始.
免费!
这是临床二期 [无对照组]: 人人得药;
[不是临床三期: 对照组得安慰剂/对照药/老药]
条件: ALK 基因重组活检阳性
FISH biopsy ALK gene rearrangement positive (translocation or inversion) to
qualify. Contact me or NIH site if you need more information.
美国价格$9,500/月[保险公司价] |
|
j**i
发帖数: 29 | 32 First, if her tumor's largest dimension is more than 2 cm, but less than 3,
it is IB. As mentioned above, her tumor should be checked for EGFR mutation
and ALK rearrangement. Whether she needs systemic therapy after surgery is
depending on her risk factors, such as positive margins, viseral pleural
involvement, wedge resection, etc. I am still concern about her bone scan
result since lung cancer mets to the bone is common. There a couple things
can be done. One is get biopsy of one of the lesion... 阅读全帖 |
|
j**i
发帖数: 29 | 33 First, if her tumor's largest dimension is more than 2 cm, but less than 3,
it is IB. As mentioned above, her tumor should be checked for EGFR mutation
and ALK rearrangement. Whether she needs systemic therapy after surgery is
depending on her risk factors, such as positive margins, viseral pleural
involvement, wedge resection, etc. I am still concern about her bone scan
result since lung cancer mets to the bone is common. There a couple things
can be done. One is get biopsy of one of the lesion... 阅读全帖 |
|
|
|
s****9
发帖数: 213 | 36 用csr的points定的机票，被jetblue取消了又rearrange到了周日，就自己多定了几天
旅馆，看了csr条款觉得压根不是我原先理解的情况啊，是只包pre-paid items，求问
这样的情况我还能怎么claim这几天的旅馆钱？ |
|
s****9
发帖数: 213 | 37 用csr的points定的机票，被jetblue取消了又rearrange到了周日，就自己多定了几天
旅馆，看了csr条款觉得压根不是我原先理解的情况啊，是只包pre-paid items，求问
这样的情况我还能怎么claim这几天的旅馆钱？ |
|
s*y
发帖数: 18644 | 38 好像不会有缺失，不过如果断的位置在成长发育中很重要的话就不好了
http://en.wikibooks.org/wiki/Handbook_of_Genetic_Counseling/Bal
* Often people will have a balanced translocation and not even know
because they don't experience any problems (this occurs in majority of cases
of new balanced rearrangements Warburton 1991)
* Sometimes, apparently balanced translocation carriers show some
characteristics or symptoms (Warburton showed that frequency of abnormality
was 6.1% but confidence interval includes 3% in apparently bal... 阅读全帖 |
|
c*******u
发帖数: 12899 | 39 ☆─────────────────────────────────────☆
MyDora (家有懒猫－迷恋咖啡香味) 于 (Thu Jan 20 23:32:03 2011, 美东) 提到:
这个要看你们俩的染色体有没有问题吧，如果父母染色体都正常的话，那 不太好说，
如果是从父母一方继承的话，应该没大问题。
☆─────────────────────────────────────☆
northbeach (Oops) 于 (Thu Jan 20 23:53:24 2011, 美东) 提到:
你应该马上找医生问，有专门遗传方面的医生啊。
translocation,
can
and
☆─────────────────────────────────────☆
qingq (asura) 于 (Thu Jan 20 23:58:02 2011, 美东) 提到:
结果出来后医生没有详细的解释？
☆─────────────────────────────────────☆
lifelove (为什么我炒鸡蛋都糊？) 于 (Thu Jan 2... 阅读全帖 |
|
b*******g
发帖数: 531 | 40 I think it is too late for babies to sleep after 9:00pm, which is difficult
time to sleep even for some adults. At 4:00-6:00pm sleeping is not good idea
. I never did that for my son.
It seems you are a quite busy mom, so your son's sleeping schedule has to
fit your schedule (like after you get your chores done). That is not right
for babies.You can keep morning nap and cancel afternoon nap. Try a couple
days.
One more thing, no matter how busy and stressful you are, please do not let
your bad f... 阅读全帖 |
|
c*******u
发帖数: 12899 | 41 ☆─────────────────────────────────────☆
maggie800104 (maggie800104) 于 (Tue Jan 10 22:36:28 2012, 美东) 提到:
女儿才四岁，很乖巧懂事，就是有时做事磨蹭，老公这是两个月来第三次打她了，
而且是在女儿洗澡的时候把她推倒，原因是嫌她动作太慢，孩子嚎啕大哭。我气的想打
电话报警
但是女儿又替她爸爸求情，说不要警察抓走爸爸。我该怎么办？以前我也劝过他不要动
手打孩子，
可是愈演愈烈了。
☆─────────────────────────────────────☆
imrobot (God is love!) 于 (Tue Jan 10 22:37:39 2012, 美东) 提到:
1 不要报警
2 老公可气
☆─────────────────────────────────────☆
imrobot (God is love!) 于 (Tue Jan 10 22:38:09 2012, 美东) 提到:
4岁女儿洗澡为啥老公要在？
☆────────────────... 阅读全帖 |
|
B****D
发帖数: 1124 | 42 I just ordered two photobooks yesterday, one from snapfish and another one
from shutterfly. First time ordering from shutterfly will see how their
quality is when I receive the book. Snapfish have pretty good deal couple
days ago $20 per book including shipping. I ordered 5/6 books from them
until now, quality is pretty good just that you can't rearrange the layout
and add those sticks to the book like the way you can with shutterfly =p |
|
d**o
发帖数: 54 | 43 Thanks. We have insurance with certain deductable amount. So there should be
some sort of insurance for summer camp programs? We are not happy mainly
for the hurt to our son today and the challenge he will have when starting
his new pre-school in September (we need talk to the chilren's center
tomorrow about whether he still can start it on time). And we have to
rearrange our schedules due to this. Basically we paid to get into trouble.
On the way to hospital I talked to my son to try to figure |
|
t*******r
发帖数: 22634 | 44 其实 heavy metal 这种 rock 主要问题，是 TMD 嗑药
的乐手太多。
Jazz 比较炫耀音乐素养，嗑了药估计手指/声带玩不转。
所以我们作为古董家长的，喜欢就一个字。。。
当然古典也炫技，不过古典的问题是，尼玛都不允许跟谱子
有一点点不同。。。作为业余的问题，是一曲下来之后，听众
中的某位，怯怯地问了一句：“你丫这么苦逼是图个啥？”。。。
Jazz 稍好些，因为弹偏了那叫 improvisation，弹错了那
叫 rearrangement。。。总之一句话，谁说俺弹/唱得不行，
那谁就是傻逼！！！
其实也不一定要真 Jazz，也有很多 cross over 的风格，
比如 classic-crossover，或者 country-pop+light-rock
crossover 啥的。。。总而言之我弹/唱出来的就是牛逼，如果
听不懂就是你丫古典钢琴老师傻逼！！！
// 哈哈，我 run 啦，勿追杀！ |
|
o**y
发帖数: 3065 | 45 There will be setbacks of housing price in the coastal cities in China,
there is no question about that. The only uncertain thing is timing.
When housing price crashed in China, some people who have several houses
might go bankrupcy, but some people will be able to afford to buy houses and
form new middle class. In other words, it's like rearrangement of the
assets, and the economy might idle for a short time, then the economy should
go up again. |
|
o**y
发帖数: 3065 | 46 I know many people argue that if the real estate bubble in China busted,
just as what happened in Japan 20 years ago, the situation in China will be
much worse. However, I don't agree with that.
The reasons that Japanese have its lost decade are many,
1. In 1990, Japanese GDP was already No.2 in the world, and the Japanese
workers' wage was also very high. At that stage, some of the Japanese
products were already losing its competitiveness in terms of the price,
although many Japanese goods were... 阅读全帖 |
|
o**y
发帖数: 3065 | 47 Don't make judgement on merely imagination.
Depreciation of gold means appreciation of US dollar, please tell me when US
will appreciates its dollars? If US dollars become a strong currency again,
what will they do with the staggering debt they owe China? If US dollars
become strong, what will they do with their already sluggish manufacture?
元》
As I said, housing bubble will be busted someday, but that is not caused by
the US factor. Chinese government has already started to slow down the real
... 阅读全帖 |
|
o**y
发帖数: 3065 | 48 I have mentioned again and again. Yes, stop introducing QE3 is the right
thing to do, because it can solve the problem at once, but it is also very
painful. The consequences of stopping QE is that, the stock market will
crash again more severely, many companies will go bankcrupt (there is no too
big to fails any more this time), the unemployment rate will be much higher
, and there might be social turnmoils. It will take a few years to rearrange
the assets, some competent people will take over t... 阅读全帖 |
|
r********p
发帖数: 57 | 49 I wrote a simple c code which will automatically calculate the cost and gain
and generate a csv file which could be imported to taxact.com online. Using
this simple code, I got my schedule D done within 30 minutes following
these steps:
1. Download your last transactions records from you broker(s) into Excel.
2. Remove unnecessary columns or rows and rearrange the columns if certain
sequence such as date sold or buy, quantity, symbols etc. Then generate *.
txt file for further process.
3. Run my |
|
l***n
发帖数: 812 | 50 The completion of WNR's rearrangement with its creditors was announced today
. this motion will provides WNR more financial flexibilities.
this news can be a catalyst to push WNR to a new high in near term. |
|
