2. 设计一个类来限制query，如1000qps，或者说每秒钟只能发10封邮件
给定的API，now()返回当前milliseconds
实现类的函数allowRequest()，如果当前还有request剩余true,否则返回false
http://www.mitbbs.com/article_t/JobHunting/32801007.html
3. Given a doubly linked list, besides the next and previous pointers, each
element has a child pointer, which may or may not point to a separate doubly
linked list. These child lists may have one or more children of their own.
Now do the following:
a. Flattern this multilevel data structure
b. Restore the original structure from the flatterned structure
Read full article from 未完成面试题 - linyx - 博客园
No comments:
Post a Comment