摘要：
https://leetcode.com/problems/evaluate-reverse-polish-notation/#/description RPN中文名字叫做逆波兰表示法，它的好处维基百科说了，就是不需要括号来表示运算的先后，直接根据式子本身就可以求解。解题思路就是维护一个栈，遇到数字 阅读全文
摘要：
这两题有一个 trick 和 Minimum Window Substring 非常像，就是维护一个 "curCount" 代表目前 (i,j) 之间 match 上的数量，而通过 hash[] 的正负充当计数器的作用 参照 k characters: http://www.cnblogs.com/ 阅读全文
摘要：
https://leetcode.com/problems/linked-list-cycle-ii/#/description 阅读全文
摘要：
ou are given a string, s, and a list of words, words, that are all of the same length. Find all starting indices of substring(s) in s that is a concat 阅读全文
摘要：
Given an array of integers and an integer k, you need to find the number of unique k-diff pairs in the array. Here ak-diff pair is defined as an integ 阅读全文
摘要：
https://leetcode.com/problems/longest-word-in-dictionary-through-deleting/#/solutions Given a string and a string dictionary, find the longest string 阅读全文
摘要：
https://leetcode.com/problems/reverse-vowels-of-a-string/#/description http://www.cnblogs.com/EdwardLiu/p/6096319.html 阅读全文