Lei comments

Results 10 comments of

Lei

[LeetCode] 215. Kth Largest Element in an Array

您好，我发现这一部分 ``` while (l pivot) { swap(nums[l++], nums[r--]); } if (nums[l] >= pivot) ++l; if (nums[r]

[LeetCode] 450. Delete Node in a BST

想问下，解法一中的 `root->left = deleteNode(root->left, key);` 为什么不是`return deleteNode(root->left, key);`

[LeetCode] 450. Delete Node in a BST

> 想问下，解法一中的 `root->left = deleteNode(root->left, key);` 为什么不是`return deleteNode(root->left, key);` 是不是：如果只是找到这个node就是递归中直接`return`, 但是这里并不是，而是找到之后remove/modify etc. 所以是赋值给root.left或者root.right

[LeetCode] 327. Count of Range Sum

您好, 请问"需要另一个下标`t`，用来拷贝所有满足 `sums[t] < sums[i]` 到一个寄存器 Cache 中以完成混合排序的过程", 这句话是什么意思啊? 我不是很懂`t`和`cache1在这里的作用

[LeetCode] 47. Permutations II

Pruning in backtracking is really a thing ... I wonder how you become a master of it

[LeetCode] 179. Largest Number

这个自定义的排序真简便

[LeetCode] 269. Alien Dictionary

这怎么想到是bfs的？我一开始看觉得是trie，后来发现不对怎么都做不出来

博主好，对最后的`board[i]][j] = c`这个回溯，你觉得什么时候应该写啊？我看比如像`200. Number of Islands`纯粹的dfs就没有，但是像这种backtracking就要回溯。是不是因为那道题只是“相邻的island”全部0变成1，只要变成1就是属于当前island后面就不用再检验；而这里word的检验，如果不相等后面还要回到原点进行检验？不知道我说清楚没有，我感觉这种区别很微妙

some sensitive words are wired.

I'm curious, did you guys seriously read all words one by one on this list?

Lei

[LeetCode] 215. Kth Largest Element in an Array

[LeetCode] 450. Delete Node in a BST

[LeetCode] 450. Delete Node in a BST

[LeetCode] 327. Count of Range Sum

[LeetCode] 47. Permutations II

[LeetCode] 179. Largest Number

[LeetCode] 36. Valid Sudoku

[LeetCode] 269. Alien Dictionary

[LeetCode] 79. Word Search

some sensitive words are wired.