In recent brush leetcode algorithm problem, also saw some of the better brushing experience Overall points title
1. Brush classification problem, according to the type of the subject, strings, arrays, trees divided off, and then may find this type according to another idea of the refinement according to succeed divided into such two points, recursion and dynamic planning.
2. easy to difficult, difficult subject may be composed of a number of simple ideas.
The following is known almost see the question of better brush tips
https://zhuanlan.zhihu.com/p/98580817
https://zhuanlan.zhihu.com/p/104983442
