Roku看网星，看完一个视频必须退出才能再看下一个# TVChinese - 中文电视
m*n
1 楼
☆─────────────────────────────────────☆
NightSnow (夜雪) 于 (Tue Jun 9 23:50:05 2009, 美东) 提到:
1. Write a function that returns a node in a tree given two parameters:
pointer to the root node and the in order traversal number of the node we
want to return. The only information stored in the tree is the number of
children for each node.
2. Input a message and a text, find if the message can be composed by the
text.
If the text is in a magazine (two pages/a paper), how to design an algorithm
?
☆
NightSnow (夜雪) 于 (Tue Jun 9 23:50:05 2009, 美东) 提到:
1. Write a function that returns a node in a tree given two parameters:
pointer to the root node and the in order traversal number of the node we
want to return. The only information stored in the tree is the number of
children for each node.
2. Input a message and a text, find if the message can be composed by the
text.
If the text is in a magazine (two pages/a paper), how to design an algorithm
?
☆
