LeetCode 301. Remove Invalid Parentheses
Using DFS method to check each possible remove.
Using DFS method to check each possible remove.
Every natural number can be represented as a sum of four non-negative integer squares. That is, the squares form an additive basis of order four
The problem is to find the next word in the wordList.
So we can use the parent to represent grandparent.
Note of learning JDBC Template(To be finished…)
Note of learning JUnit
Note of learning AOP.
Note about how to realize a IOC.
This is note of learning IOC management.
Because the tasks have cooldown period, so we want the task with maximum occurrences do first.