摘要:
## 直接法 ```java public int removeDuplicates(int[] nums) { if (nums == null) { return -1; } boolean start = false; int nextIndex = 1; for (int i = 1; i 阅读全文
摘要:
## 暴力枚举 ```java class Solution { public List generateParenthesis(int n) { List list = getAll(2 * n); List result = new ArrayList(); for (String item : 阅读全文
摘要:
## 递归 自己写了个递归的算法 ```java class Solution { public List letterCombinations(String digits) { List resList = recursion(digits); return resList; } public L 阅读全文