2016年1月15日
**Minimum Window Substring & String类问题模板
摘要： Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n).For example,S="ADOBECODEBA... 阅读全文
posted @ 2016-01-15 14:36 Hygeia 阅读(474) 评论(0) 推荐(0)
**Word Ladder
摘要： Given two words (beginWordandendWord), and a dictionary's word list, find the length of shortest transformation sequence frombeginWordtoendWord, such ... 阅读全文
posted @ 2016-01-15 13:58 Hygeia 阅读(245) 评论(0) 推荐(0)
*Longest Increasing Subsequence
摘要： Given an unsorted array of integers, find the length of longest increasing subsequence.For example,Given[10, 9, 2, 5, 3, 7, 101, 18],The longest incre... 阅读全文
posted @ 2016-01-15 01:28 Hygeia 阅读(193) 评论(0) 推荐(0)