Rainbow Stone
Tuesday, September 16, 2014
面经
1.
1. behavior + sort color
2-1. Binary number add
2-2. Matrix中有G,X,O三种字符,按照与G的距离改变O为最小距离的char(eg。‘1’,‘2’)
3. 设计news feed API
4. 根据dict设计数据结构,判断一个含有*的单词是否合法(*可以取代任意一个字符) trie树实现(常见题)
No comments:
Post a Comment
Newer Post
Older Post
Home
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment