I was just telling my wife this morning that since the weather is abnormal
recent two days ( drizzling in July in southern Cal?), maybe earthquake is
likely, and here it is, Bang! I have this feeling, the abnormal weather
really could be related to earthquake.
【在 w*******r 的大作中提到】 : I was just telling my wife this morning that since the weather is abnormal : recent two days ( drizzling in July in southern Cal?), maybe earthquake is : likely, and here it is, Bang! I have this feeling, the abnormal weather : really could be related to earthquake.
s*f
9 楼
good one
e*s
10 楼
like
y*0
11 楼
赞,希望早日进入诉讼程序
w*r
12 楼
But in my memory of the past 10 years, there usually has no rain in July.
【在 r****t 的大作中提到】 : 每年 6 月都是这样,今年长点。这个叫 june gloom 还是啥的。
Actually I like this weather more. It feels more normal than usual sunny
days. I grew up in a place with weather like this every day. Never got used
to SoCal's so-called benefit of sun shine.
【在 w*******r 的大作中提到】 : I was just telling my wife this morning that since the weather is abnormal : recent two days ( drizzling in July in southern Cal?), maybe earthquake is : likely, and here it is, Bang! I have this feeling, the abnormal weather : really could be related to earthquake.
y*g
22 楼
bfs
【在 f********e 的大作中提到】 : 三面那个题怎么解啊?
t*8
23 楼
支持!
【在 N*********L 的大作中提到】 : 谢谢支持!应该不影响,不过要问律师。
w*r
24 楼
Occassional rain fall is pretty refreshing.
used
【在 r****t 的大作中提到】 : Actually I like this weather more. It feels more normal than usual sunny : days. I grew up in a place with weather like this every day. Never got used : to SoCal's so-called benefit of sun shine.
r*n
25 楼
大牛,能大致写个伪码结构给参考下吗?
【在 y*******g 的大作中提到】 : bfs
h*a
26 楼
原告需要做什么事? 什么样的资格才够做原告?
l*a
27 楼
常见题,不需要大牛 自己去看careercup150
【在 r******n 的大作中提到】 : 大牛,能大致写个伪码结构给参考下吗?
f*i
28 楼
感谢NIU的工作!
s*f
29 楼
// 打印从棋盘的一个角落到另一个角落所有路径 // this is toooooo hard, seems NP hard. cannot be DP // if chess can only go right or down, here it is struct Point{ int x; int y; Point(int xx, int yy):x(xx),y(yy){ }; friend bool operator== (Point &p1, Point &p2); }; bool operator== (Point &p1, Point &p2){ return p1.x == p2.x && p1.y == p2.y; } void PrintPoint(Point &p){ printf("(%d, %d)", p.x, p.y); } void PrintAllChessPath(Point &p1, Point &p2){ static vector path; path.push_back(p1); if (p1 == p2){ for_each(path.begin(), path.end(), PrintPoint); printf("\n"); path.pop_back(); return; } if (p1.x < p2.x){ PrintAllChessPath(Point(p1.x + 1, p1.y), p2); } if (p1.y < p2.y){ PrintAllChessPath(Point(p1.x, p1.y + 1), p2); } path.pop_back(); }
f*i
30 楼
感谢蔡律师,刚才看了简历,很牛的人!
q*x
31 楼
慢。
【在 y*******g 的大作中提到】 : bfs
L*2
32 楼
Great Work! Thank you very much
y*g
33 楼
你给个解法?
【在 q****x 的大作中提到】 : 慢。
a*d
34 楼
感谢你们的辛勤工作!
Z*4
35 楼
msft: reverse string里面的words 经典的那个。 amazon: 一面: 概念题, ood设计题, regular expressions sql 二面: 打印从棋盘的一个角落到另一个角落所有路径 三面: 有一个dictionary, 从一个given start word 怎么变换到一个 end word 类似 于 edit distance 但是简单些 所有的words都是4个字母。 要求每次变换得到的 中间 word都是字典里面的。每次只能变换一个字母。