总结

模板

https://oj.leetcode.com/problems/subsets 相当于遍历而非分治

http://www.lintcode.com/en/problem/binary-search/

http://www.ninechapter.com/solutions/dfs-template/ 遍历(输入结果收集器不可并行)或分治(返回结果可并行)

http://www.ninechapter.com/solutions/bfs-template/ 进入每层前保存size

重点题

三步反转法

https://oj.leetcode.com/problems/reverse-words-in-a-string/
https://leetcode.com/problems/reverse-words-in-a-string-ii/
https://leetcode.com/problems/rotate-array/
http://lintcode.com/en/problem/rotate-string/
http://lintcode.com/en/problem/recover-rotated-sorted-array/
https://leetcode.com/problems/rotate-list/

其他

二维问题可以想想四叉树