摘要:
public List<List<Integer>> levelOrderBottom(TreeNode root) { LinkedList<List<Integer>> res = new LinkedList<>(); if(root == null){ return res; } Queue 阅读全文
摘要:
这道题自己完成的,不难。 回溯。 public boolean exist(char[][] board, String word) { int m = board.length; int n = board[0].length; int wordLength = word.length(); if 阅读全文
摘要:
看了大佬的题解,茅塞顿开 public void solveSudoku(char[][] board) { if(board == null || board.length != 9 || board[0] == null || board[0].length != 9){ return; } b 阅读全文