b**f
发帖数: 20 | 1 1.unix command to find directory having file containing phone number
2.Polymorphism
3.final, finally, finalize in java
4.reconstruct tree from a file that is composed of ordered pairs (parentid,
childid) |
c******f
发帖数: 2144 | |
B*****t
发帖数: 335 | |
y*c
发帖数: 904 | 4 第一个用grep? 什么参数是打印dir的
还有怎么让grep stop after several matches. 找到一个-m 但是matching lines. |
b*****j
发帖数: 930 | |
s********l
发帖数: 998 | 6 第4个
建一个tree 根据每个node里面parentid和childid吗？
,
【在 b**f 的大作中提到】
: 1.unix command to find directory having file containing phone number
: 2.Polymorphism
: 3.final, finally, finalize in java
: 4.reconstruct tree from a file that is composed of ordered pairs (parentid,
: childid)
|
b**f
发帖数: 20 | 7 Yes
【在 s********l 的大作中提到】
: 第4个
: 建一个tree 根据每个node里面parentid和childid吗？
:
: ,
|
b**f
发帖数: 20 | 8 I don't know. That is what I told him.
【在 y*c 的大作中提到】
: 第一个用grep? 什么参数是打印dir的
: 还有怎么让grep stop after several matches. 找到一个-m 但是matching lines.
|
r********g
发帖数: 144 | 9
if I can use a std::map in C++, this problem would be easy: use id as key of
the map and the tree node pointer as the data of the map. this makes the
search to be log(n).
【在 s********l 的大作中提到】
: 第4个
: 建一个tree 根据每个node里面parentid和childid吗？
:
: ,
|
