陈耿聪是个狠人

未归档

《机器学习》(3) 《计算机网络》(1)

/ 注册

全部文章 / 未归档（共254篇）

706. Design HashMap

class MyHashMap { int [] hashmap ; /** Initialize your data structure here. */ public MyHashMap() { hashmap = new int [1000001]...

2019-08-28

0 451

187.Repeated DNA Sequences

class Solution { HashMap hm; HashSet ls; public List findRepeatedDnaSequences(String s) { hm = new HashMap(); ls = new Ha...

2019-08-27

0 438

473. Matchsticks to Square

https://www.acwing.com/solution/LeetCode/content/3785/ class Solution { private boolean flag; public boolean makesquare(int[] nums) { ...

2019-08-24

0 474

37. 解数独

步骤1 ：将所有的值保存到列行 3*3矩阵中步骤2 : 1~9 判断那个值可以选可以选代入然后回复现场 class Solution { boolean col[][]; boolean row[][]; boolean cell[][][]; publi...

2019-08-24

0 507

51. N皇后

class Solution { int count; List ls; int n; boolean bool[][]; public List> solveNQueens(int n) { count = 0; ls ...

2019-08-23

0 417

216. 组合总和 III

class Solution { private List ls; private int n; private LinkedList path; private int k; private int[] arr = new int[] { 1, 2, 3, ...

2019-08-22

0 443

90. 子集 II

class Solution { private List ls; private int n; private LinkedList path; public List> subsetsWithDup(int[] nums) { ls = ne...

2019-08-22

0 443

78. 子集

递归 class Solution { private List ls; private boolean []bool; private int n; public List> subsets(int[] nums) { n = nums.le...

2019-08-21

0 464

LeetCode 47. Permutations II

class Solution { private int n; private List ls; private boolean[] bool; private LinkedList path; public List> permuteUnique(in...

2019-08-20

0 478

46. 全排列

class Solution { private LinkedList ans = new LinkedList(); private int n; private LinkedList path = new LinkedList(); private boolean...

2019-08-19

0 429