摘要:
/** * https://leetcode-cn.com/problems/3sum/ */public class _15_三数之和 { public List<List<Integer>> threeSum(int[] nums) { if (nums == null) return null 阅读全文
posted @ 2021-07-06 10:21
syh-918
阅读(36)
评论(0)
推荐(0)
摘要:
/** * https://leetcode-cn.com/problems/two-sum/ */public class _1_两数之和 { public int[] twoSum(int[] nums, int target) { if (nums == null) return null; 阅读全文
posted @ 2021-07-06 10:18
syh-918
阅读(33)
评论(0)
推荐(0)
摘要:
/** * https://leetcode-cn.com/problems/permutations-ii/ */public class _47_全排列II { public List<List<Integer>> permuteUnique(int[] nums) { if (nums == 阅读全文
posted @ 2021-07-06 10:16
syh-918
阅读(98)
评论(0)
推荐(0)
摘要:
/** * https://leetcode-cn.com/problems/permutations/ */public class _46_全排列3 { public List<List<Integer>> permute(int[] nums) { if (nums == null) retu 阅读全文
posted @ 2021-07-06 10:07
syh-918
阅读(29)
评论(0)
推荐(0)
摘要:
/** * https://leetcode-cn.com/problems/generate-parentheses/ */public class _22_括号生成 { public List<String> generateParenthesis(int n) { List<String> l 阅读全文
posted @ 2021-07-06 10:02
syh-918
阅读(57)
评论(0)
推荐(0)
摘要:
/** * https://leetcode-cn.com/problems/letter-combinations-of-a-phone-number/ */ 解法二: public class _17_电话号码的字母组合2 { private char[][] lettersArray = { 阅读全文
posted @ 2021-07-06 09:57
syh-918
阅读(121)
评论(0)
推荐(0)
浙公网安备 33010602011771号