摘要：
This answer is so awesome!! 阅读全文
摘要：
1 Remember : Always make integer validation at hasNext() since it is too late to validate it at next(). 阅读全文
摘要：
1. Has to be sorted if originally not sorted. 2. When merge end point, it could be totally covered instead of intersect. 阅读全文
摘要：
class Solution { public boolean wordBreak(String s, List wordDict) { if (s == null || s.length() == 0) { return false; } boolean[] canBreak = new bool... 阅读全文
摘要：
1. When dot happened, each path should be scanned. 2. Each node will not contain any current char info. 阅读全文