daomingQian

var sequentialDigits = function(low, high) { let arr = [ 12, 23, 34, 45, 56, 67, 78, 89, 123, 234, 345, 456, 567, 678, 789, 1234, 2345, 3456,4567, 5678, 6789,...

``` var readBinaryWatch = function (turnedOn) { if (turnedOn === 9 || turnedOn === 10) return [] if(turnedOn === 0) ["0:00"] const arr = ['8', '4', '2', '1', 32, 16,...

不使用前缀树 时间超过百分之88 ``` var findWords = function (board, words) { const lenbCol = board.length const lenbRow = board[0].length const lenw = words.length const res = [] const point = [[1,0],[-1,0],[0,1],[0,-1]]...

双百解答 ``` var getMaximumGold = function (grid) { let max = 0 const leni = grid.length const lenj = grid[0].length function dfs(i, j) { const cur = grid[i][j] let t1...

``` var combine = function(n, k) { let res = []; function tfs(start, path){ let length = path.length; if(length === k){ res.push([...path]); return; } if(length > k) return; let rest...

``` var combinationSum = function(candidates, target) { let res = [] let len = candidates.length function sum(arr) { return arr.reduce((pre, cur) => pre + cur, 0) } function tfs(start, path)...

``` var solveNQueens = function (n) { let row = new Array(n).fill().map(() => false) let col = new Array(n).fill().map(() => false) let board = new Array(n).fill().map(() => new Array(n).fill('.')) let...

只能等die了