2016年9月22日
Leetcode Binary Search Conclusion
摘要： 278 First Bad Version23.7%Easy 278. First Bad Version 349 Intersection of Two Arrays44.5%Easy 374 Guess Number Higher or Lower32.2%Easy 350 Intersecti 阅读全文
posted @ 2016-09-22 05:09 咖啡中不塌缩的方糖 阅读(100) 评论(0) 推荐(0) 编辑
50. Pow(x, n)
摘要： Implement pow(x, n). 阅读全文
posted @ 2016-09-22 05:08 咖啡中不塌缩的方糖 阅读(104) 评论(0) 推荐(0) 编辑
278. First Bad Version
摘要： You are a product manager and currently leading a team to develop a new product. Unfortunately, the latest version of your product fails the quality c 阅读全文
posted @ 2016-09-22 04:42 咖啡中不塌缩的方糖 阅读(95) 评论(0) 推荐(0) 编辑
336. Palindrome Pairs
摘要： Given a list of unique words. Find all pairs of distinct indices (i, j) in the given list, so that the concatenation of the two words, i.e.words[i] + 阅读全文
posted @ 2016-09-22 04:18 咖啡中不塌缩的方糖 阅读(97) 评论(0) 推荐(0) 编辑
Leetcode Trie Conclusion
摘要： Implement Trie (Prefix Tree) 208. Implement Trie (Prefix Tree) Add and Search Word - Data structure design 211. Add and Search Word - Data structure design Word Search II 212. Word Search ... 阅读全文
posted @ 2016-09-22 03:07 咖啡中不塌缩的方糖 阅读(102) 评论(0) 推荐(0) 编辑
212. Word Search II
摘要： Given a 2D board and a list of words from the dictionary, find all words in the board. Each word must be constructed from letters of sequentially adja 阅读全文
posted @ 2016-09-22 01:25 咖啡中不塌缩的方糖 阅读(151) 评论(0) 推荐(0) 编辑