amazon电面跪了# JobHunting - 待字闺中
s*g
1 楼
Given a 2d array, find the the shape count.就是有1的连续片段的数目。脑袋木了
, collabedit上写了一团乱麻。老爸在旁边切菜,别interviewer叫停了。。。
e.g 1
[
[101]
[010]
[111]
]
count = 3
e.g 2
[
[111]
[001]
[111]
]
count = 1
e.g 3
[
[111111111111]
[000000000001]
[111000000001]
[100000100001]
[100000000001]
[100000000001]
[111111111111]
]
count = 2
, collabedit上写了一团乱麻。老爸在旁边切菜,别interviewer叫停了。。。
e.g 1
[
[101]
[010]
[111]
]
count = 3
e.g 2
[
[111]
[001]
[111]
]
count = 1
e.g 3
[
[111111111111]
[000000000001]
[111000000001]
[100000100001]
[100000000001]
[100000000001]
[111111111111]
]
count = 2