algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-09 03:34:02 +08:00
Code Issues Packages Projects Releases Wiki Activity

Merge branch 'master' of github.com:youngyangyang04/leetcode-master

Browse Source
This commit is contained in:
youngyangyang04
2022-03-22 09:29:39 +08:00
parent c408f7babc df03d48833
commit 52ff487eb6
35 changed files with 1250 additions and 382 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
problems/0001.两数之和.md
View File

@ -118,6 +118,18 @@ class Solution:
return [records[target - val], idx] # 如果存在就返回字典记录索引和当前索引 return [records[target - val], idx] # 如果存在就返回字典记录索引和当前索引
``` ```
Python (v2):
```python
class Solution:
def twoSum(self, nums: List[int], target: int) -> List[int]:
rec = {}
for i in range(len(nums)):
rest = target - nums[i]
# Use get to get the index of the data, making use of one of the dictionary properties.
if rec.get(rest, None) is not None: return [rec[rest], i]
rec[nums[i]] = i
```
Go： Go：

37
problems/0005.最长回文子串.md
View File

@ -260,7 +260,26 @@ public:
# 其他语言版本 # 其他语言版本
## Java Java：
```java
public int[] twoSum(int[] nums, int target) {
int[] res = new int[2];
if(nums == null || nums.length == 0){
return res;
}
Map<Integer, Integer> map = new HashMap<>();
for(int i = 0; i < nums.length; i++){
int temp = target - nums[i];
if(map.containsKey(temp)){
res[1] = i;
res[0] = map.get(temp);
}
map.put(nums[i], i);
}
return res;
}
```
```java ```java
// 双指针 中心扩散法 // 双指针 中心扩散法
@ -291,7 +310,7 @@ class Solution {
} }
``` ```
## Python Python：
```python ```python
class Solution: class Solution:
@ -312,7 +331,8 @@ class Solution:
return s[left:right + 1] return s[left:right + 1]
``` ```
> 双指针法： 双指针：
```python ```python
class Solution: class Solution:
def longestPalindrome(self, s: str) -> str: def longestPalindrome(self, s: str) -> str:
@ -340,13 +360,13 @@ class Solution:
return s[start:end] return s[start:end]
``` ```
## Go Go：
```go ```go
``` ```
## JavaScript JavaScript：
```js ```js
//动态规划解法 //动态规划解法
@ -462,8 +482,9 @@ var longestPalindrome = function(s) {
}; };
``` ```
## C C：
动态规划:
动态规划：
```c ```c
//初始化dp数组，全部初始为false //初始化dp数组，全部初始为false
bool **initDP(int strLen) { bool **initDP(int strLen) {
@ -513,7 +534,7 @@ char * longestPalindrome(char * s){
} }
``` ```
双指针: 双指针：
```c ```c
int left, maxLength; int left, maxLength;
void extend(char *str, int i, int j, int size) { void extend(char *str, int i, int j, int size) {

27
problems/0015.三数之和.md
View File

@ -247,7 +247,34 @@ class Solution:
right -= 1 right -= 1
return ans return ans
``` ```
Python (v2):
```python
class Solution:
def threeSum(self, nums: List[int]) -> List[List[int]]:
if len(nums) < 3: return []
nums, res = sorted(nums), []
for i in range(len(nums) - 2):
cur, l, r = nums[i], i + 1, len(nums) - 1
if res != [] and res[-1][0] == cur: continue # Drop duplicates for the first time.
while l < r:
if cur + nums[l] + nums[r] == 0:
res.append([cur, nums[l], nums[r]])
# Drop duplicates for the second time in interation of l & r. Only used when target situation occurs, because that is the reason for dropping duplicates.
while l < r - 1 and nums[l] == nums[l + 1]:
l += 1
while r > l + 1 and nums[r] == nums[r - 1]:
r -= 1
if cur + nums[l] + nums[r] > 0:
r -= 1
else:
l += 1
return res
```
Go： Go：
```Go ```Go
func threeSum(nums []int)[][]int{ func threeSum(nums []int)[][]int{
sort.Ints(nums) sort.Ints(nums)

11
problems/0018.四数之和.md
View File

@ -216,6 +216,7 @@ class Solution(object):
# good thing about using python is you can use set to drop duplicates. # good thing about using python is you can use set to drop duplicates.
ans = set() ans = set()
# ans = [] # save results by list()
for i in range(len(nums)): for i in range(len(nums)):
for j in range(i + 1, len(nums)): for j in range(i + 1, len(nums)):
for k in range(j + 1, len(nums)): for k in range(j + 1, len(nums)):
@ -224,10 +225,16 @@ class Solution(object):
# make sure no duplicates. # make sure no duplicates.
count = (nums[i] == val) + (nums[j] == val) + (nums[k] == val) count = (nums[i] == val) + (nums[j] == val) + (nums[k] == val)
if hashmap[val] > count: if hashmap[val] > count:
ans.add(tuple(sorted([nums[i], nums[j], nums[k], val]))) ans_tmp = tuple(sorted([nums[i], nums[j], nums[k], val]))
ans.add(ans_tmp)
# Avoiding duplication in list manner but it cause time complexity increases
# if ans_tmp not in ans:
# ans.append(ans_tmp)
else: else:
continue continue
return ans return list(ans)
# if used list() to save results, just
# return ans
``` ```

1
problems/0053.最大子序和（动态规划）.md
View File

@ -174,6 +174,7 @@ const maxSubArray = nums => {
// 数组长度，dp初始化 // 数组长度，dp初始化
const len = nums.length; const len = nums.length;
let dp = new Array(len).fill(0); let dp = new Array(len).fill(0);
dp[0] = nums[0];
// 最大值初始化为dp[0] // 最大值初始化为dp[0]
let max = dp[0]; let max = dp[0];
for (let i = 1; i < len; i++) { for (let i = 1; i < len; i++) {

60
problems/0059.螺旋矩阵II.md
View File

@ -192,47 +192,31 @@ python3:
```python ```python
class Solution: class Solution:
def generateMatrix(self, n: int) -> List[List[int]]: def generateMatrix(self, n: int) -> List[List[int]]:
# 初始化要填充的正方形 nums = [[0] * n for _ in range(n)]
matrix = [[0] * n for _ in range(n)] startx, starty = 0, 0 # 起始点
loop, mid = n // 2, n // 2 # 迭代次数、n为奇数时，矩阵的中心点
count = 1 # 计数
left, right, up, down = 0, n - 1, 0, n - 1 for offset in range(1, loop + 1) : # 每循环一层偏移量加1，偏移量从1开始
number = 1 # 要填充的数字 for i in range(starty, n - offset) : # 从左至右，左闭右开
nums[startx][i] = count
count += 1
for i in range(startx, n - offset) : # 从上至下
nums[i][n - offset] = count
count += 1
for i in range(n - offset, starty, -1) : # 从右至左
nums[n - offset][i] = count
count += 1
for i in range(n - offset, startx, -1) : # 从下至上
nums[i][starty] = count
count += 1
startx += 1 # 更新起始点
starty += 1
while left < right and up < down: if n % 2 != 0 : # n为奇数时，填充中心点
nums[mid][mid] = count
# 从左到右填充上边 return nums
for x in range(left, right):
matrix[up][x] = number
number += 1
# 从上到下填充右边
for y in range(up, down):
matrix[y][right] = number
number += 1
# 从右到左填充下边
for x in range(right, left, -1):
matrix[down][x] = number
number += 1
# 从下到上填充左边
for y in range(down, up, -1):
matrix[y][left] = number
number += 1
# 缩小要填充的范围
left += 1
right -= 1
up += 1
down -= 1
# 如果阶数为奇数，额外填充一次中心
if n % 2:
matrix[n // 2][n // 2] = number
return matrix
``` ```
javaScript javaScript

42
problems/0098.验证二叉搜索树.md
View File

@ -526,6 +526,48 @@ var isValidBST = function (root) {
}; };
``` ```
## TypeScript
> 辅助数组解决：
```typescript
function isValidBST(root: TreeNode | null): boolean {
const traversalArr: number[] = [];
function inorderTraverse(root: TreeNode | null): void {
if (root === null) return;
inorderTraverse(root.left);
traversalArr.push(root.val);
inorderTraverse(root.right);
}
inorderTraverse(root);
for (let i = 0, length = traversalArr.length; i < length - 1; i++) {
if (traversalArr[i] >= traversalArr[i + 1]) return false;
}
return true;
};
```
> 递归中解决：
```typescript
function isValidBST(root: TreeNode | null): boolean {
let maxVal = -Infinity;
function inorderTraverse(root: TreeNode | null): boolean {
if (root === null) return true;
let leftValid: boolean = inorderTraverse(root.left);
if (!leftValid) return false;
if (maxVal < root.val) {
maxVal = root.val
} else {
return false;
}
let rightValid: boolean = inorderTraverse(root.right);
return leftValid && rightValid;
}
return inorderTraverse(root);
};
```
----------------------- -----------------------

35
problems/0101.对称二叉树.md
View File

@ -437,6 +437,41 @@ class Solution:
return True return True
``` ```
层序遍历
```python
class Solution:
def isSymmetric(self, root: TreeNode) -> bool:
if not root: return True
que, cnt = [[root.left, root.right]], 1
while que:
nodes, tmp, sign = que.pop(), [], False
for node in nodes:
if not node:
tmp.append(None)
tmp.append(None)
else:
if node.left:
tmp.append(node.left)
sign = True
else:
tmp.append(None)
if node.right:
tmp.append(node.right)
sign = True
else:
tmp.append(None)
p1, p2 = 0, len(nodes) - 1
while p1 < p2:
if (not nodes[p1] and nodes[p2]) or (nodes[p1] and not nodes[p2]): return False
elif nodes[p1] and nodes[p2] and nodes[p1].val != nodes[p2].val: return False
p1 += 1
p2 -= 1
if sign: que.append(tmp)
cnt += 1
return True
```
## Go ## Go
```go ```go

332
problems/0102.二叉树的层序遍历.md
View File

@ -273,32 +273,29 @@ function levelOrder(root: TreeNode | null): number[][] {
}; };
``` ```
Swift: Swift：
```swift ```swift
func levelOrder(_ root: TreeNode?) -> [[Int]] { func levelOrder(_ root: TreeNode?) -> [[Int]] {
var res = [[Int]]() var result = [[Int]]()
guard let root = root else { guard let root = root else { return result }
return res // 表示一层
} var queue = [root]
var queue = [TreeNode]()
queue.append(root)
while !queue.isEmpty { while !queue.isEmpty {
let size = queue.count let count = queue.count
var sub = [Int]() var subarray = [Int]()
for _ in 0 ..< size { for _ in 0 ..< count {
// 当前层
let node = queue.removeFirst() let node = queue.removeFirst()
sub.append(node.val) subarray.append(node.val)
if let left = node.left { // 下一层
queue.append(left) if let node = node.left { queue.append(node) }
if let node = node.right { queue.append(node) }
} }
if let right = node.right { result.append(subarray)
queue.append(right)
} }
}
res.append(sub) return result
}
return res
} }
``` ```
@ -505,30 +502,29 @@ function levelOrderBottom(root: TreeNode | null): number[][] {
}; };
``` ```
Swift: Swift：
```swift ```swift
func levelOrderBottom(_ root: TreeNode?) -> [[Int]] { func levelOrderBottom(_ root: TreeNode?) -> [[Int]] {
var res = [[Int]]() // 表示一层
guard let root = root else { var queue = [TreeNode]()
return res if let node = root { queue.append(node) }
} var result = [[Int]]()
var queue: [TreeNode] = [root]
while !queue.isEmpty { while !queue.isEmpty {
var sub = [Int]() let count = queue.count
for _ in 0 ..< queue.count { var subarray = [Int]()
for _ in 0 ..< count {
// 当前层
let node = queue.removeFirst() let node = queue.removeFirst()
sub.append(node.val) subarray.append(node.val)
if let left = node.left { // 下一层
queue.append(left) if let node = node.left { queue.append(node) }
if let node = node.right { queue.append(node)}
} }
if let right = node.right { result.append(subarray)
queue.append(right)
} }
}
res.insert(sub, at: 0) return result.reversed()
}
return res
} }
``` ```
@ -729,37 +725,31 @@ function rightSideView(root: TreeNode | null): number[] {
}; };
``` ```
Swift: Swift：
```swift ```swift
func rightSideView(_ root: TreeNode?) -> [Int] { func rightSideView(_ root: TreeNode?) -> [Int] {
var res = [Int]() // 表示一层
guard let root = root else {
return res
}
var queue = [TreeNode]() var queue = [TreeNode]()
queue.append(root) if let node = root { queue.append(node) }
var result = [Int]()
while !queue.isEmpty { while !queue.isEmpty {
let size = queue.count let count = queue.count
for i in 0 ..< size { for i in 0 ..< count {
// 当前层
let node = queue.removeFirst() let node = queue.removeFirst()
if i == size - 1 { if i == count - 1 { result.append(node.val) }
// 保存 每层最后一个元素
res.append(node.val) // 下一层
} if let node = node.left { queue.append(node) }
if let left = node.left { if let node = node.right { queue.append(node) }
queue.append(left)
}
if let right = node.right {
queue.append(right)
} }
} }
}
return res return result
} }
``` ```
# 637.二叉树的层平均值 # 637.二叉树的层平均值
[力扣题目链接](https://leetcode-cn.com/problems/average-of-levels-in-binary-tree/) [力扣题目链接](https://leetcode-cn.com/problems/average-of-levels-in-binary-tree/)
@ -965,32 +955,30 @@ function averageOfLevels(root: TreeNode | null): number[] {
}; };
``` ```
Swift: Swift：
```swift ```swift
func averageOfLevels(_ root: TreeNode?) -> [Double] { func averageOfLevels(_ root: TreeNode?) -> [Double] {
var res = [Double]() // 表示一层
guard let root = root else {
return res
}
var queue = [TreeNode]() var queue = [TreeNode]()
queue.append(root) if let node = root { queue.append(node) }
var result = [Double]()
while !queue.isEmpty { while !queue.isEmpty {
let size = queue.count let count = queue.count
var sum = 0 var sum = 0
for _ in 0 ..< size { for _ in 0 ..< count {
// 当前层
let node = queue.removeFirst() let node = queue.removeFirst()
sum += node.val sum += node.val
if let left = node.left {
queue.append(left) // 下一层
if let node = node.left { queue.append(node) }
if let node = node.right { queue.append(node) }
} }
if let right = node.right { result.append(Double(sum) / Double(count))
queue.append(right)
} }
}
res.append(Double(sum) / Double(size)) return result
}
return res
} }
``` ```
@ -1212,29 +1200,28 @@ function levelOrder(root: Node | null): number[][] {
}; };
``` ```
Swift: Swift：
```swift ```swift
func levelOrder(_ root: Node?) -> [[Int]] { func levelOrder(_ root: Node?) -> [[Int]] {
var res = [[Int]]() // 表示一层
guard let root = root else {
return res
}
var queue = [Node]() var queue = [Node]()
queue.append(root) if let node = root { queue.append(node) }
var result = [[Int]]()
while !queue.isEmpty { while !queue.isEmpty {
let size = queue.count let count = queue.count
var sub = [Int]() var subarray = [Int]()
for _ in 0 ..< size { for _ in 0 ..< count {
// 当前层
let node = queue.removeFirst() let node = queue.removeFirst()
sub.append(node.val) subarray.append(node.val)
for childNode in node.children { // 下一层
queue.append(childNode) for node in node.children { queue.append(node) }
} }
result.append(subarray)
} }
res.append(sub)
} return result
return res
} }
``` ```
@ -1419,34 +1406,30 @@ function largestValues(root: TreeNode | null): number[] {
}; };
``` ```
Swift: Swift：
```swift ```swift
func largestValues(_ root: TreeNode?) -> [Int] { func largestValues(_ root: TreeNode?) -> [Int] {
var res = [Int]() // 表示一层
guard let root = root else {
return res
}
var queue = [TreeNode]() var queue = [TreeNode]()
queue.append(root) if let node = root { queue.append(node) }
var result = [Int]()
while !queue.isEmpty { while !queue.isEmpty {
let size = queue.count let count = queue.count
var max: Int = Int.min var max = queue[0].val
for _ in 0 ..< size { for _ in 0 ..< count {
// 当前层
let node = queue.removeFirst() let node = queue.removeFirst()
if node.val > max { if node.val > max { max = node.val }
max = node.val
// 下一层
if let node = node.left { queue.append(node) }
if let node = node.right { queue.append(node) }
} }
if let left = node.left { result.append(max)
queue.append(left)
} }
if let right = node.right {
queue.append(right) return result
}
}
res.append(max)
}
return res
} }
``` ```
@ -1456,7 +1439,7 @@ func largestValues(_ root: TreeNode?) -> [Int] {
给定一个完美二叉树，其所有叶子节点都在同一层，每个父节点都有两个子节点。二叉树定义如下： 给定一个完美二叉树，其所有叶子节点都在同一层，每个父节点都有两个子节点。二叉树定义如下：
``` ```cpp
struct Node { struct Node {
int val; int val;
Node *left; Node *left;
@ -1677,33 +1660,34 @@ func connect(root *Node) *Node {
} }
``` ```
Swift: Swift：
```swift ```swift
func connect(_ root: Node?) -> Node? { func connect(_ root: Node?) -> Node? {
guard let root = root else { // 表示一层
return nil
}
var queue = [Node]() var queue = [Node]()
queue.append(root) if let node = root { queue.append(node) }
while !queue.isEmpty { while !queue.isEmpty {
let size = queue.count let count = queue.count
var preNode: Node? var current, previous: Node!
for i in 0 ..< size { for i in 0 ..< count {
let node = queue.removeFirst() // 当前层
if i == 0 { if i == 0 {
preNode = node previous = queue.removeFirst()
current = previous
} else { } else {
preNode?.next = node current = queue.removeFirst()
preNode = node previous.next = current
} previous = current
if let left = node.left {
queue.append(left)
}
if let right = node.right {
queue.append(right)
} }
// 下一层
if let node = current.left { queue.append(node) }
if let node = current.right { queue.append(node) }
} }
previous.next = nil
} }
return root return root
} }
``` ```
@ -1927,34 +1911,34 @@ func connect(root *Node) *Node {
return root return root
} }
``` ```
Swift： Swift：
```swift ```swift
func connect(_ root: Node?) -> Node? { func connect(_ root: Node?) -> Node? {
guard let root = root else { // 表示一层
return nil
}
var queue = [Node]() var queue = [Node]()
queue.append(root) if let node = root { queue.append(node) }
while !queue.isEmpty { while !queue.isEmpty {
let size = queue.count let count = queue.count
var preNode: Node? var current, previous: Node!
for i in 0 ..< size { for i in 0 ..< count {
let node = queue.removeFirst() // 当前层
if i == 0 { if i == 0 {
preNode = node previous = queue.removeFirst()
current = previous
} else { } else {
preNode?.next = node current = queue.removeFirst()
preNode = node previous.next = current
} previous = current
if let left = node.left {
queue.append(left)
}
if let right = node.right {
queue.append(right)
} }
// 下一层
if let node = current.left { queue.append(node) }
if let node = current.right { queue.append(node) }
} }
previous.next = nil
} }
return root return root
} }
``` ```
@ -2151,29 +2135,28 @@ function maxDepth(root: TreeNode | null): number {
}; };
``` ```
Swift: Swift：
```swift ```swift
func maxDepth(_ root: TreeNode?) -> Int { func maxDepth(_ root: TreeNode?) -> Int {
guard let root = root else { guard root != nil else { return 0 }
return 0 var depth = 0
}
var queue = [TreeNode]() var queue = [TreeNode]()
queue.append(root) queue.append(root!)
var res: Int = 0
while !queue.isEmpty { while !queue.isEmpty {
for _ in 0 ..< queue.count { let count = queue.count
depth += 1
for _ in 0 ..< count {
// 当前层
let node = queue.removeFirst() let node = queue.removeFirst()
if let left = node.left {
queue.append(left) // 下一层
} if let node = node.left { queue.append(node) }
if let right = node.right { if let node = node.right { queue.append(node) }
queue.append(right)
} }
} }
res += 1
} return depth
return res
} }
``` ```
@ -2374,28 +2357,25 @@ Swift：
```swift ```swift
func minDepth(_ root: TreeNode?) -> Int { func minDepth(_ root: TreeNode?) -> Int {
guard let root = root else { guard root != nil else { return 0 }
return 0 var depth = 0
} var queue = [root!]
var res = 0
var queue = [TreeNode]()
queue.append(root)
while !queue.isEmpty { while !queue.isEmpty {
res += 1 let count = queue.count
for _ in 0 ..< queue.count { depth += 1
for _ in 0 ..< count {
// 当前层
let node = queue.removeFirst() let node = queue.removeFirst()
if node.left == nil && node.right == nil { if node.left == nil, node.right == nil { // 遇到叶子结点则返回
return res return depth
} }
if let left = node.left {
queue.append(left) // 下一层
} if let node = node.left { queue.append(node) }
if let right = node.right { if let node = node.right { queue.append(node) }
queue.append(right)
} }
} }
} return depth
return res
} }
``` ```

4
problems/0106.从中序与后序遍历序列构造二叉树.md
View File

@ -89,9 +89,9 @@ TreeNode* traversal (vector<int>& inorder, vector<int>& postorder) {
**难点大家应该发现了，就是如何切割，以及边界值找不好很容易乱套。** **难点大家应该发现了，就是如何切割，以及边界值找不好很容易乱套。**
此时应该注意确定切割的标准，是左闭右开，还有左开又闭，还是左闭又闭，这个就是不变量，要在递归中保持这个不变量。 此时应该注意确定切割的标准，是左闭右开，还有左开右闭，还是左闭右闭，这个就是不变量，要在递归中保持这个不变量。
**在切割的过程中会产生四个区间，把握不好不变量的话，一会左闭右开，一会左闭又闭，必然乱套！** **在切割的过程中会产生四个区间，把握不好不变量的话，一会左闭右开，一会左闭右闭，必然乱套！**
我在[数组：每次遇到二分法，都是一看就会，一写就废](https://programmercarl.com/0035.搜索插入位置.html)和[数组：这个循环可以转懵很多人！](https://programmercarl.com/0059.螺旋矩阵II.html)中都强调过循环不变量的重要性，在二分查找以及螺旋矩阵的求解中，坚持循环不变量非常重要，本题也是。 我在[数组：每次遇到二分法，都是一看就会，一写就废](https://programmercarl.com/0035.搜索插入位置.html)和[数组：这个循环可以转懵很多人！](https://programmercarl.com/0059.螺旋矩阵II.html)中都强调过循环不变量的重要性，在二分查找以及螺旋矩阵的求解中，坚持循环不变量非常重要，本题也是。

45
problems/0116.填充每个节点的下一个右侧节点指针.md
View File

@ -211,9 +211,52 @@ class Solution:
return root return root
``` ```
## Go ## Go
```go ```go
// 迭代法
func connect(root *Node) *Node {
if root == nil {
return root
}
stack := make([]*Node, 0)
stack = append(stack, root)
for len(stack) > 0 {
n := len(stack) // 记录当前层节点个数
for i := 0; i < n; i++ {
node := stack[0] // 依次弹出节点
stack = stack[1:]
if i == n - 1 { // 如果是这层最右的节点，next指向nil
node.Next = nil
} else {
node.Next = stack[0] // 如果不是最右的节点，next指向右边的节点
}
if node.Left != nil { // 如果存在左子节点，放入栈中
stack = append(stack, node.Left)
}
if node.Right != nil { // 如果存在右子节点，放入栈中
stack = append(stack, node.Right)
}
}
}
return root
}
```
```go
// 常量级额外空间，使用next
func connect(root *Node) *Node {
if root == nil {
return root
}
for cur := root; cur.Left != nil; cur = cur.Left { // 遍历每层最左边的节点
for node := cur; node != nil; node = node.Next { // 当前层从左到右遍历
node.Left.Next = node.Right // 左子节点next指向右子节点
if node.Next != nil { //如果node next有值，右子节点指向next节点的左子节点
node.Right.Next = node.Next.Left
}
}
}
return root
}
``` ```
## JavaScript ## JavaScript

9
problems/0139.单词拆分.md
View File

@ -89,27 +89,26 @@ class Solution {
private: private:
bool backtracking (const string& s, bool backtracking (const string& s,
const unordered_set<string>& wordSet, const unordered_set<string>& wordSet,
vector<int>& memory, vector<bool>& memory,
int startIndex) { int startIndex) {
if (startIndex >= s.size()) { if (startIndex >= s.size()) {
return true; return true;
} }
// 如果memory[startIndex]不是初始值了，直接使用memory[startIndex]的结果 // 如果memory[startIndex]不是初始值了，直接使用memory[startIndex]的结果
if (memory[startIndex] != -1) return memory[startIndex]; if (!memory[startIndex]) return memory[startIndex];
for (int i = startIndex; i < s.size(); i++) { for (int i = startIndex; i < s.size(); i++) {
string word = s.substr(startIndex, i - startIndex + 1); string word = s.substr(startIndex, i - startIndex + 1);
if (wordSet.find(word) != wordSet.end() && backtracking(s, wordSet, memory, i + 1)) { if (wordSet.find(word) != wordSet.end() && backtracking(s, wordSet, memory, i + 1)) {
memory[startIndex] = 1; // 记录以startIndex开始的子串是可以被拆分的
return true; return true;
} }
} }
memory[startIndex] = 0; // 记录以startIndex开始的子串是不可以被拆分的 memory[startIndex] = false; // 记录以startIndex开始的子串是不可以被拆分的
return false; return false;
} }
public: public:
bool wordBreak(string s, vector<string>& wordDict) { bool wordBreak(string s, vector<string>& wordDict) {
unordered_set<string> wordSet(wordDict.begin(), wordDict.end()); unordered_set<string> wordSet(wordDict.begin(), wordDict.end());
vector<int> memory(s.size(), -1); // -1 表示初始化状态 vector<bool> memory(s.size(), 1); // -1 表示初始化状态
return backtracking(s, wordSet, memory, 0); return backtracking(s, wordSet, memory, 0);
} }
}; };

32
problems/0151.翻转字符串里的单词.md
View File

@ -438,6 +438,38 @@ class Solution:
``` ```
```python
class Solution:
def reverseWords(self, s: str) -> str:
# method 1 - Rude but work & efficient method.
s_list = [i for i in s.split(" ") if len(i) > 0]
return " ".join(s_list[::-1])
# method 2 - Carlo's idea
def trim_head_tail_space(ss: str):
p = 0
while p < len(ss) and ss[p] == " ":
p += 1
return ss[p:]
# Trim the head and tail space
s = trim_head_tail_space(s)
s = trim_head_tail_space(s[::-1])[::-1]
pf, ps, s = 0, 0, s[::-1] # Reverse the string.
while pf < len(s):
if s[pf] == " ":
# Will not excede. Because we have clean the tail space.
if s[pf] == s[pf + 1]:
s = s[:pf] + s[pf + 1:]
continue
else:
s = s[:ps] + s[ps: pf][::-1] + s[pf:]
ps, pf = pf + 1, pf + 2
else:
pf += 1
return s[:ps] + s[ps:][::-1] # Must do the last step, because the last word is omit though the pointers are on the correct positions,
```
Go： Go：

63
problems/0226.翻转二叉树.md
View File

@ -47,8 +47,6 @@
## 递归法 ## 递归法
对于二叉树的递归法的前中后序遍历，已经在[二叉树：前中后序递归遍历](https://programmercarl.com/二叉树的递归遍历.html)详细讲解了。 对于二叉树的递归法的前中后序遍历，已经在[二叉树：前中后序递归遍历](https://programmercarl.com/二叉树的递归遍历.html)详细讲解了。
我们下文以前序遍历为例，通过动画来看一下翻转的过程: 我们下文以前序遍历为例，通过动画来看一下翻转的过程:
@ -63,7 +61,7 @@
返回值的话其实也不需要，但是题目中给出的要返回root节点的指针，可以直接使用题目定义好的函数，所以就函数的返回类型为`TreeNode*`。 返回值的话其实也不需要，但是题目中给出的要返回root节点的指针，可以直接使用题目定义好的函数，所以就函数的返回类型为`TreeNode*`。
``` ```cpp
TreeNode* invertTree(TreeNode* root) TreeNode* invertTree(TreeNode* root)
``` ```
@ -71,7 +69,7 @@ TreeNode* invertTree(TreeNode* root)
当前节点为空的时候，就返回 当前节点为空的时候，就返回
``` ```cpp
if (root == NULL) return root; if (root == NULL) return root;
``` ```
@ -79,7 +77,7 @@ if (root == NULL) return root;
因为是先前序遍历，所以先进行交换左右孩子节点，然后反转左子树，反转右子树。 因为是先前序遍历，所以先进行交换左右孩子节点，然后反转左子树，反转右子树。
``` ```cpp
swap(root->left, root->right); swap(root->left, root->right);
invertTree(root->left); invertTree(root->left);
invertTree(root->right); invertTree(root->right);
@ -257,7 +255,7 @@ public:
## 其他语言版本 ## 其他语言版本
### Java： ### Java
```Java ```Java
//DFS递归 //DFS递归
@ -469,8 +467,6 @@ func invertTree(root *TreeNode) *TreeNode {
} }
``` ```
### JavaScript ### JavaScript
使用递归版本的前序遍历 使用递归版本的前序遍历
@ -690,7 +686,7 @@ function invertTree(root: TreeNode | null): TreeNode | null {
}; };
``` ```
### C: ### C
递归法 递归法
```c ```c
@ -775,5 +771,54 @@ func invertTree1(_ root: TreeNode?) -> TreeNode? {
} }
``` ```
### Swift
深度优先递归。
```swift
func invertTree(_ root: TreeNode?) -> TreeNode? {
guard let node = root else { return root }
swap(&node.left, &node.right)
_ = invertTree(node.left)
_ = invertTree(node.right)
return root
}
```
深度优先迭代，子结点顺序不重要，从根结点出发深度遍历即可。
```swift
func invertTree(_ root: TreeNode?) -> TreeNode? {
guard let node = root else { return root }
var stack = [node]
while !stack.isEmpty {
guard let node = stack.popLast() else { break }
swap(&node.left, &node.right)
if let node = node.left { stack.append(node) }
if let node = node.right { stack.append(node) }
}
return root
}
```
广度优先迭代。
```swift
func invertTree(_ root: TreeNode?) -> TreeNode? {
guard let node = root else { return root }
var queue = [node]
while !queue.isEmpty {
let count = queue.count
for _ in 0 ..< count {
let node = queue.removeFirst()
swap(&node.left, &node.right)
if let node = node.left { queue.append(node) }
if let node = node.right { queue.append(node) }
}
}
return root
}
```
----------------------- -----------------------
<div align="center"><img src=https://code-thinking.cdn.bcebos.com/pics/01二维码一.jpg width=500> </img></div> <div align="center"><img src=https://code-thinking.cdn.bcebos.com/pics/01二维码一.jpg width=500> </img></div>

33
problems/0235.二叉搜索树的最近公共祖先.md
View File

@ -350,6 +350,39 @@ var lowestCommonAncestor = function(root, p, q) {
}; };
``` ```
## TypeScript
> 递归法：
```typescript
function lowestCommonAncestor(root: TreeNode | null, p: TreeNode | null, q: TreeNode | null): TreeNode | null {
if (root.val > p.val && root.val > q.val)
return lowestCommonAncestor(root.left, p, q);
if (root.val < p.val && root.val < q.val)
return lowestCommonAncestor(root.right, p, q);
return root;
};
```
> 迭代法：
```typescript
function lowestCommonAncestor(root: TreeNode | null, p: TreeNode | null, q: TreeNode | null): TreeNode | null {
while (root !== null) {
if (root.val > p.val && root.val > q.val) {
root = root.left;
} else if (root.val < p.val && root.val < q.val) {
root = root.right;
} else {
return root;
};
};
return null;
};
```
----------------------- -----------------------
<div align="center"><img src=https://code-thinking.cdn.bcebos.com/pics/01二维码一.jpg width=500> </img></div> <div align="center"><img src=https://code-thinking.cdn.bcebos.com/pics/01二维码一.jpg width=500> </img></div>

14
problems/0236.二叉树的最近公共祖先.md
View File

@ -325,6 +325,20 @@ var lowestCommonAncestor = function(root, p, q) {
}; };
``` ```
## TypeScript
```typescript
function lowestCommonAncestor(root: TreeNode | null, p: TreeNode | null, q: TreeNode | null): TreeNode | null {
if (root === null || root === p || root === q) return root;
const left = lowestCommonAncestor(root.left, p, q);
const right = lowestCommonAncestor(root.right, p, q);
if (left !== null && right !== null) return root;
if (left !== null) return left;
if (right !== null) return right;
return null;
};
```
----------------------- -----------------------

2
problems/0300.最长上升子序列.md
View File

@ -37,7 +37,7 @@
1. dp[i]的定义 1. dp[i]的定义
**dp[i]表示i之前包括i的最长上升子序列的长度**。 **dp[i]表示i之前包括i的以nums[i]结尾最长上升子序列的长度**
2. 状态转移方程 2. 状态转移方程

18
problems/0309.最佳买卖股票时机含冷冻期.md
View File

@ -284,6 +284,24 @@ const maxProfit = (prices) => {
}; };
``` ```
```javascript
// 一维数组空间优化
const maxProfit = (prices) => {
const n = prices.length
const dp = new Array(4).fill(0)
dp[0] = -prices[0]
for (let i = 1; i < n; i ++) {
const temp = dp[0] // 缓存上一次的状态
const temp1 = dp[2]
dp[0] = Math.max(dp[0], Math.max(dp[3] - prices[i], dp[1] - prices[i])) // 持有状态
dp[1] = Math.max(dp[1], dp[3]) // 今天不操作且不持有股票
dp[2] = temp + prices[i] // 今天卖出股票
dp[3] = temp1 // 冷冻期
}
return Math.max(...dp)
};
```
----------------------- -----------------------
<div align="center"><img src=https://code-thinking.cdn.bcebos.com/pics/01二维码一.jpg width=500> </img></div> <div align="center"><img src=https://code-thinking.cdn.bcebos.com/pics/01二维码一.jpg width=500> </img></div>

17
problems/0454.四数相加II.md
View File

@ -141,7 +141,24 @@ class Solution(object):
``` ```
```python
class Solution:
def fourSumCount(self, nums1: list, nums2: list, nums3: list, nums4: list) -> int:
from collections import defaultdict # You may use normal dict instead.
rec, cnt = defaultdict(lambda : 0), 0
# To store the summary of all the possible combinations of nums1 & nums2, together with their frequencies.
for i in nums1:
for j in nums2:
rec[i+j] += 1
# To add up the frequencies if the corresponding value occurs in the dictionary
for i in nums3:
for j in nums4:
cnt += rec.get(-(i+j), 0) # No matched key, return 0.
return cnt
```
Go： Go：
```go ```go
func fourSumCount(nums1 []int, nums2 []int, nums3 []int, nums4 []int) int { func fourSumCount(nums1 []int, nums2 []int, nums3 []int, nums4 []int) int {
m := make(map[int]int) m := make(map[int]int)

34
problems/0491.递增子序列.md
View File

@ -227,7 +227,39 @@ class Solution {
} }
} }
``` ```
```java
//法二：使用map
class Solution {
//结果集合
List<List<Integer>> res = new ArrayList<>();
//路径集合
LinkedList<Integer> path = new LinkedList<>();
public List<List<Integer>> findSubsequences(int[] nums) {
getSubsequences(nums,0);
return res;
}
private void getSubsequences( int[] nums, int start ) {
if(path.size()>1 ){
res.add( new ArrayList<>(path) );
// 注意这里不要加return，要取树上的节点
}
HashMap<Integer,Integer> map = new HashMap<>();
for(int i=start ;i < nums.length ;i++){
if(!path.isEmpty() && nums[i]< path.getLast()){
continue;
}
// 使用过了当前数字
if ( map.getOrDefault( nums[i],0 ) >=1 ){
continue;
}
map.put(nums[i],map.getOrDefault( nums[i],0 )+1);
path.add( nums[i] );
getSubsequences( nums,i+1 );
path.removeLast();
}
}
}
```
### Python ### Python

101
problems/0501.二叉搜索树中的众数.md
View File

@ -699,6 +699,107 @@ var findMode = function(root) {
}; };
``` ```
## TypeScript
> 辅助Map法
```typescript
function findMode(root: TreeNode | null): number[] {
if (root === null) return [];
const countMap: Map<number, number> = new Map();
function traverse(root: TreeNode | null): void {
if (root === null) return;
countMap.set(root.val, (countMap.get(root.val) || 0) + 1);
traverse(root.left);
traverse(root.right);
}
traverse(root);
const countArr: number[][] = Array.from(countMap);
countArr.sort((a, b) => {
return b[1] - a[1];
})
const resArr: number[] = [];
const maxCount: number = countArr[0][1];
for (let i of countArr) {
if (i[1] === maxCount) resArr.push(i[0]);
}
return resArr;
};
```
> 递归中直接解决
```typescript
function findMode(root: TreeNode | null): number[] {
let preNode: TreeNode | null = null;
let maxCount: number = 0;
let count: number = 0;
let resArr: number[] = [];
function traverse(root: TreeNode | null): void {
if (root === null) return;
traverse(root.left);
if (preNode === null) { // 第一个节点
count = 1;
} else if (preNode.val === root.val) {
count++;
} else {
count = 1;
}
if (count === maxCount) {
resArr.push(root.val);
} else if (count > maxCount) {
maxCount = count;
resArr.length = 0;
resArr.push(root.val);
}
preNode = root;
traverse(root.right);
}
traverse(root);
return resArr;
};
```
> 迭代法
```typescript
function findMode(root: TreeNode | null): number[] {
const helperStack: TreeNode[] = [];
const resArr: number[] = [];
let maxCount: number = 0;
let count: number = 0;
let preNode: TreeNode | null = null;
let curNode: TreeNode | null = root;
while (curNode !== null || helperStack.length > 0) {
if (curNode !== null) {
helperStack.push(curNode);
curNode = curNode.left;
} else {
curNode = helperStack.pop()!;
if (preNode === null) { // 第一个节点
count = 1;
} else if (preNode.val === curNode.val) {
count++;
} else {
count = 1;
}
if (count === maxCount) {
resArr.push(curNode.val);
} else if (count > maxCount) {
maxCount = count;
resArr.length = 0;
resArr.push(curNode.val);
}
preNode = curNode;
curNode = curNode.right;
}
}
return resArr;
};
```
----------------------- -----------------------
<div align="center"><img src=https://code-thinking.cdn.bcebos.com/pics/01二维码一.jpg width=500> </img></div> <div align="center"><img src=https://code-thinking.cdn.bcebos.com/pics/01二维码一.jpg width=500> </img></div>

69
problems/0530.二叉搜索树的最小绝对差.md
View File

@ -364,5 +364,74 @@ var getMinimumDifference = function(root) {
} }
``` ```
## TypeScript
> 辅助数组解决
```typescript
function getMinimumDifference(root: TreeNode | null): number {
let helperArr: number[] = [];
function recur(root: TreeNode | null): void {
if (root === null) return;
recur(root.left);
helperArr.push(root.val);
recur(root.right);
}
recur(root);
let resMin: number = Infinity;
for (let i = 0, length = helperArr.length; i < length - 1; i++) {
resMin = Math.min(resMin, helperArr[i + 1] - helperArr[i]);
}
return resMin;
};
```
> 递归中解决
```typescript
function getMinimumDifference(root: TreeNode | null): number {
let preNode: TreeNode | null= null;
let resMin: number = Infinity;
function recur(root: TreeNode | null): void {
if (root === null) return;
recur(root.left);
if (preNode !== null) {
resMin = Math.min(resMin, root.val - preNode.val);
}
preNode = root;
recur(root.right);
}
recur(root);
return resMin;
};
```
> 迭代法-中序遍历
```typescript
function getMinimumDifference(root: TreeNode | null): number {
const helperStack: TreeNode[] = [];
let curNode: TreeNode | null = root;
let resMin: number = Infinity;
let preNode: TreeNode | null = null;
while (curNode !== null || helperStack.length > 0) {
if (curNode !== null) {
helperStack.push(curNode);
curNode = curNode.left;
} else {
curNode = helperStack.pop()!;
if (preNode !== null) {
resMin = Math.min(resMin, curNode.val - preNode.val);
}
preNode = curNode;
curNode = curNode.right;
}
}
return resMin;
};
```
----------------------- -----------------------
<div align="center"><img src=https://code-thinking.cdn.bcebos.com/pics/01二维码一.jpg width=500> </img></div> <div align="center"><img src=https://code-thinking.cdn.bcebos.com/pics/01二维码一.jpg width=500> </img></div>

38
problems/0541.反转字符串II.md
View File

@ -98,8 +98,31 @@ public:
## 其他语言版本 ## 其他语言版本
C：
```c
char * reverseStr(char * s, int k){
int len = strlen(s);
for (int i = 0; i < len; i += (2 * k)) {
//判断剩余字符是否少于 k
k = i + k > len ? len - i : k;
int left = i;
int right = i + k - 1;
while (left < right) {
char temp = s[left];
s[left++] = s[right];
s[right--] = temp;
}
}
return s;
}
```
Java： Java：
```Java ```Java
//解法一 //解法一
class Solution { class Solution {
@ -204,8 +227,23 @@ class Solution:
return ''.join(res) return ''.join(res)
``` ```
Python3 (v2):
```python
class Solution:
def reverseStr(self, s: str, k: int) -> str:
# Two pointers. Another is inside the loop.
p = 0
while p < len(s):
p2 = p + k
# Written in this could be more pythonic.
s = s[:p] + s[p: p2][::-1] + s[p2:]
p = p + 2 * k
return s
```
Go： Go：
```go ```go
func reverseStr(s string, k int) string { func reverseStr(s string, k int) string {
ss := []byte(s) ss := []byte(s)

50
problems/0617.合并二叉树.md
View File

@ -583,6 +583,56 @@ var mergeTrees = function(root1, root2) {
``` ```
## TypeScript
> 递归法：
```type
function mergeTrees(root1: TreeNode | null, root2: TreeNode | null): TreeNode | null {
if (root1 === null) return root2;
if (root2 === null) return root1;
const resNode: TreeNode = new TreeNode(root1.val + root2.val);
resNode.left = mergeTrees(root1.left, root2.left);
resNode.right = mergeTrees(root1.right, root2.right);
return resNode;
};
```
> 迭代法：
```typescript
function mergeTrees(root1: TreeNode | null, root2: TreeNode | null): TreeNode | null {
if (root1 === null) return root2;
if (root2 === null) return root1;
const helperQueue1: TreeNode[] = [],
helperQueue2: TreeNode[] = [];
helperQueue1.push(root1);
helperQueue2.push(root2);
let tempNode1: TreeNode,
tempNode2: TreeNode;
while (helperQueue1.length > 0) {
tempNode1 = helperQueue1.shift()!;
tempNode2 = helperQueue2.shift()!;
tempNode1.val += tempNode2.val;
if (tempNode1.left !== null && tempNode2.left !== null) {
helperQueue1.push(tempNode1.left);
helperQueue2.push(tempNode2.left);
} else if (tempNode1.left === null) {
tempNode1.left = tempNode2.left;
}
if (tempNode1.right !== null && tempNode2.right !== null) {
helperQueue1.push(tempNode1.right);
helperQueue2.push(tempNode2.right);
} else if (tempNode1.right === null) {
tempNode1.right = tempNode2.right;
}
}
return root1;
};
```
----------------------- -----------------------
<div align="center"><img src=https://code-thinking.cdn.bcebos.com/pics/01二维码一.jpg width=500> </img></div> <div align="center"><img src=https://code-thinking.cdn.bcebos.com/pics/01二维码一.jpg width=500> </img></div>

39
problems/0700.二叉搜索树中的搜索.md
View File

@ -200,7 +200,7 @@ class Solution {
if (val < root.val) root = root.left; if (val < root.val) root = root.left;
else if (val > root.val) root = root.right; else if (val > root.val) root = root.right;
else return root; else return root;
return root; return null;
} }
} }
``` ```
@ -236,7 +236,7 @@ class Solution:
if val < root.val: root = root.left if val < root.val: root = root.left
elif val > root.val: root = root.right elif val > root.val: root = root.right
else: return root else: return root
return root return None
``` ```
@ -271,7 +271,7 @@ func searchBST(root *TreeNode, val int) *TreeNode {
break break
} }
} }
return root return nil
} }
``` ```
@ -301,7 +301,6 @@ var searchBST = function (root, val) {
return searchBST(root.left, val); return searchBST(root.left, val);
if (root.val < val) if (root.val < val)
return searchBST(root.right, val); return searchBST(root.right, val);
return null;
}; };
``` ```
@ -330,7 +329,37 @@ var searchBST = function (root, val) {
else else
return root; return root;
} }
return root; return null;
};
```
## TypeScript
> 递归法
```typescript
function searchBST(root: TreeNode | null, val: number): TreeNode | null {
if (root === null || root.val === val) return root;
if (root.val < val) return searchBST(root.right, val);
if (root.val > val) return searchBST(root.left, val);
return null;
};
```
> 迭代法
```typescript
function searchBST(root: TreeNode | null, val: number): TreeNode | null {
let resNode: TreeNode | null = root;
while (resNode !== null) {
if (resNode.val === val) return resNode;
if (resNode.val < val) {
resNode = resNode.right;
} else {
resNode = resNode.left;
}
}
return null;
}; };
``` ```

46
problems/0704.二分查找.md
View File

@ -561,5 +561,51 @@ class Solution {
} }
``` ```
**C#:**
```csharp
//左闭右闭
public class Solution {
public int Search(int[] nums, int target) {
int left = 0;
int right = nums.Length - 1;
while(left <= right){
int mid = (right - left ) / 2 + left;
if(nums[mid] == target){
return mid;
}
else if(nums[mid] < target){
left = mid+1;
}
else if(nums[mid] > target){
right = mid-1;
}
}
return -1;
}
}
//左闭右开
public class Solution{
public int Search(int[] nums, int target){
int left = 0;
int right = nums.Length;
while(left < right){
int mid = (right - left) / 2 + left;
if(nums[mid] == target){
return mid;
}
else if(nums[mid] < target){
left = mid + 1;
}
else if(nums[mid] > target){
right = mid;
}
}
return -1;
}
}
```
----------------------- -----------------------
<div align="center"><img src=https://code-thinking.cdn.bcebos.com/pics/01二维码一.jpg width=500> </img></div> <div align="center"><img src=https://code-thinking.cdn.bcebos.com/pics/01二维码一.jpg width=500> </img></div>

24
problems/0738.单调递增的数字.md
View File

@ -148,23 +148,19 @@ java版本1中创建了String数组，多次使用Integer.parseInt了方法，
版本2 版本2
class Solution { class Solution {
public int monotoneIncreasingDigits(int n) { public int monotoneIncreasingDigits(int n) {
if (n==0)return 0; String s = String.valueOf(n);
char[] chars= Integer.toString(n).toCharArray(); char[] chars = s.toCharArray();
int start=Integer.MAX_VALUE;//start初始值设为最大值，这是为了防止当数字本身是单调递增时，没有一位数字需要改成9的情况 int start = s.length();
for (int i=chars.length-1;i>0;i--){ for (int i = s.length() - 2; i >= 0; i--) {
if (chars[i]<chars[i-1]){ if (chars[i] > chars[i + 1]) {
chars[i-1]--; chars[i]--;
start=i; start = i+1;
} }
} }
StringBuilder res=new StringBuilder(); for (int i = start; i < s.length(); i++) {
for (int i=0;i<chars.length;i++){ chars[i] = '9';
if (chars[i]=='0'&&i==0)continue;//防止出现09这样的情况
if (i>=start){
res.append('9');
}else res.append(chars[i]);
} }
return Integer.parseInt(res.toString()); return Integer.parseInt(String.valueOf(chars));
} }
} }
``` ```

68
problems/0739.每日温度.md
View File

@ -177,34 +177,60 @@ public:
Java： Java：
```java ```java
/**
* 单调栈，栈内顺序要么从大到小 要么从小到大,本题从大到小 class Solution {
* <p> // 版本 1
* 入站元素要和当前栈内栈首元素进行比较 public int[] dailyTemperatures(int[] temperatures) {
* 若大于栈首则 则与元素下标做差
* 若大于等于则放入 int lens=temperatures.length;
* int []res=new int[lens];
* @param temperatures
* @return
*/
public static int[] dailyTemperatures(int[] temperatures) {
Stack<Integer> stack = new Stack<>();
int[] res = new int[temperatures.length];
for (int i = 0; i < temperatures.length; i++) {
/** /**
* 取出下标进行元素值的比较 如果当前遍历的元素 大于栈顶元素，表示 栈顶元素的 右边的最大的元素就是 当前遍历的元素，
所以弹出 栈顶元素，并记录
如果栈不空的话，还要考虑新的栈顶与当前元素的大小关系
否则的话，可以直接入栈。
注意，单调栈里 加入的元素是 下标。
*/ */
while (!stack.isEmpty() && temperatures[i] > temperatures[stack.peek()]) { Stack<Integer>stack=new Stack<>();
int preIndex = stack.pop(); stack.push(0);
res[preIndex] = i - preIndex; for(int i=1;i<lens;i++){
if(temperatures[i]<=temperatures[stack.peek()]){
stack.push(i);
}else{
while(!stack.isEmpty()&&temperatures[i]>temperatures[stack.peek()]){
res[stack.peek()]=i-stack.peek();
stack.pop();
} }
/**
* 注意 放入的是元素位置
*/
stack.push(i); stack.push(i);
} }
}
return res; return res;
} }
//--------这 是一条分界线
// 版本 2
class Solution {
public int[] dailyTemperatures(int[] temperatures) {
int lens=temperatures.length;
int []res=new int[lens];
Stack<Integer>stack=new Stack<>();
for(int i=0;i<lens;i++){
while(!stack.isEmpty()&&temperatures[i]>temperatures[stack.peek()]){
res[stack.peek()]=i-stack.peek();
stack.pop();
}
stack.push(i);
}
return res;
}
}
}
``` ```
Python： Python：
``` Python3 ``` Python3

20
problems/0860.柠檬水找零.md
View File

@ -128,24 +128,24 @@ public:
```java ```java
class Solution { class Solution {
public boolean lemonadeChange(int[] bills) { public boolean lemonadeChange(int[] bills) {
int cash_5 = 0; int five = 0;
int cash_10 = 0; int ten = 0;
for (int i = 0; i < bills.length; i++) { for (int i = 0; i < bills.length; i++) {
if (bills[i] == 5) { if (bills[i] == 5) {
cash_5++; five++;
} else if (bills[i] == 10) { } else if (bills[i] == 10) {
cash_5--; five--;
cash_10++; ten++;
} else if (bills[i] == 20) { } else if (bills[i] == 20) {
if (cash_10 > 0) { if (ten > 0) {
cash_10--; ten--;
cash_5--; five--;
} else { } else {
cash_5 -= 3; five -= 3;
} }
} }
if (cash_5 < 0 || cash_10 < 0) return false; if (five < 0 || ten < 0) return false;
} }
return true; return true;

48
problems/0968.监控二叉树.md
View File

@ -316,28 +316,44 @@ public:
### Java ### Java
```java ```java
class Solution { class Solution {
private int count = 0; int res=0;
public int minCameraCover(TreeNode root) { public int minCameraCover(TreeNode root) {
if (trval(root) == 0) count++; // 对根节点的状态做检验,防止根节点是无覆盖状态 .
return count; if(minCame(root)==0){
res++;
} }
return res;
private int trval(TreeNode root) { }
if (root == null) return -1; /**
节点的状态值：
int left = trval(root.left); 0 表示无覆盖
int right = trval(root.right); 1 表示 有摄像头
2 表示有覆盖
if (left == 0 || right == 0) { 后序遍历，根据左右节点的情况,来判读 自己的状态
count++; */
public int minCame(TreeNode root){
if(root==null){
// 空节点默认为 有覆盖状态，避免在叶子节点上放摄像头
return 2; return 2;
} }
int left=minCame(root.left);
int right=minCame(root.right);
if (left == 2 || right == 2) { // 如果左右节点都覆盖了的话, 那么本节点的状态就应该是无覆盖,没有摄像头
return 1; if(left==2&&right==2){
} //(2,2)
return 0; return 0;
}else if(left==0||right==0){
// 左右节点都是无覆盖状态,那 根节点此时应该放一个摄像头
// (0,0) (0,1) (0,2) (1,0) (2,0)
// 状态值为 1 摄像头数 ++;
res++;
return 1;
}else{
// 左右节点的 状态为 (1,1) (1,2) (2,1) 也就是左右节点至少存在 1个摄像头，
// 那么本节点就是处于被覆盖状态
return 2;
}
} }
} }
``` ```

35
problems/1002.查找常用字符.md
View File

@ -253,6 +253,41 @@ var commonChars = function (words) {
return res return res
}; };
``` ```
TypeScript
```ts
console.time("test")
let str: string = ""
//设置一个用字母组成的map字典
let map = new Map<string, number>()
//给所有map设置初始值为0
let wordInitial: [string, number][] = words[0]
.split("")
.map((item) => [item, 0])
//如果有重复字母,就把重复字母的数量加1
for (let word of words[0]) {
map.set(word, map.has(word) ? map.get(word) + 1 : 1)
}
for (let i = 1; i < words.length; i++) {
const mapWord = new Map<string, number>(wordInitial)
for (let j = 0; j < words[i].length; j++) {
if (!map.has(words[i][j])) continue
//mapWord中的字母的个数不能高于当前map的个数,多于则不能添加
if (map.get(words[i][j]) > mapWord.get(words[i][j])) {
mapWord.set(
words[i][j],
mapWord.has(words[i][j]) ? mapWord!.get(words[i][j]) + 1 : 1
)
}
}
//每次重新初始化map
map = mapWord
}
for (let [key, value] of map) {
str += key.repeat(value)
}
console.timeEnd("test")
return str.split("")
```
GO GO
```golang ```golang
func commonChars(words []string) []string { func commonChars(words []string) []string {

104
problems/二叉树的迭代遍历.md
View File

@ -390,7 +390,7 @@ func inorderTraversal(root *TreeNode) []int {
} }
``` ```
javaScript javaScript：
```js ```js
@ -454,7 +454,7 @@ var postorderTraversal = function(root, res = []) {
}; };
``` ```
TypeScript: TypeScript：
```typescript ```typescript
// 前序遍历（迭代法） // 前序遍历（迭代法）
@ -509,77 +509,63 @@ function postorderTraversal(root: TreeNode | null): number[] {
}; };
``` ```
Swift: Swift：
> 迭代法前序遍历
```swift ```swift
// 前序遍历迭代法
func preorderTraversal(_ root: TreeNode?) -> [Int] { func preorderTraversal(_ root: TreeNode?) -> [Int] {
var res = [Int]() var result = [Int]()
if root == nil { guard let root = root else { return result }
return res var stack = [root]
}
var stack = [TreeNode]()
stack.append(root!)
while !stack.isEmpty { while !stack.isEmpty {
let node = stack.popLast()! let current = stack.removeLast()
res.append(node.val) // 先右后左，这样出栈的时候才是左右顺序
if node.right != nil { if let node = current.right { // 右
stack.append(node.right!) stack.append(node)
} }
if node.left != nil { if let node = current.left { // 左
stack.append(node.left!) stack.append(node)
} }
result.append(current.val) // 中
} }
return res return result
} }
```
> 迭代法中序遍历 // 后序遍历迭代法
```swift
func inorderTraversal(_ root: TreeNode?) -> [Int] {
var res = [Int]()
if root == nil {
return res
}
var stack = [TreeNode]()
var cur: TreeNode? = root
while cur != nil || !stack.isEmpty {
if cur != nil {
stack.append(cur!)
cur = cur!.left
} else {
cur = stack.popLast()
res.append(cur!.val)
cur = cur!.right
}
}
return res
}
```
> 迭代法后序遍历
```swift
func postorderTraversal(_ root: TreeNode?) -> [Int] { func postorderTraversal(_ root: TreeNode?) -> [Int] {
var res = [Int]() var result = [Int]()
if root == nil { guard let root = root else { return result }
return res var stack = [root]
}
var stack = [TreeNode]()
stack.append(root!)
// res 存储 中 -> 右 -> 左
while !stack.isEmpty { while !stack.isEmpty {
let node = stack.popLast()! let current = stack.removeLast()
res.append(node.val) // 与前序相反，即中右左，最后结果还需反转才是后序
if node.left != nil { if let node = current.left { // 左
stack.append(node.left!) stack.append(node)
} }
if node.right != nil { if let node = current.right { // 右
stack.append(node.right!) stack.append(node)
}
result.append(current.val) // 中
}
return result.reversed()
}
// 中序遍历迭代法
func inorderTraversal(_ root: TreeNode?) -> [Int] {
var result = [Int]()
var stack = [TreeNode]()
var current: TreeNode! = root
while current != nil || !stack.isEmpty {
if current != nil { // 先访问到最左叶子
stack.append(current)
current = current.left // 左
} else {
current = stack.removeLast()
result.append(current.val) // 中
current = current.right // 右
} }
} }
// res 翻转 return result
res.reverse()
return res
} }
``` ```

6
problems/二叉树的递归遍历.md
View File

@ -34,19 +34,19 @@
1. **确定递归函数的参数和返回值**：因为要打印出前序遍历节点的数值，所以参数里需要传入vector在放节点的数值，除了这一点就不需要在处理什么数据了也不需要有返回值，所以递归函数返回类型就是void，代码如下： 1. **确定递归函数的参数和返回值**：因为要打印出前序遍历节点的数值，所以参数里需要传入vector在放节点的数值，除了这一点就不需要在处理什么数据了也不需要有返回值，所以递归函数返回类型就是void，代码如下：
``` ```cpp
void traversal(TreeNode* cur, vector<int>& vec) void traversal(TreeNode* cur, vector<int>& vec)
``` ```
2. **确定终止条件**：在递归的过程中，如何算是递归结束了呢，当然是当前遍历的节点是空了，那么本层递归就要要结束了，所以如果当前遍历的这个节点是空，就直接return，代码如下： 2. **确定终止条件**：在递归的过程中，如何算是递归结束了呢，当然是当前遍历的节点是空了，那么本层递归就要要结束了，所以如果当前遍历的这个节点是空，就直接return，代码如下：
``` ```cpp
if (cur == NULL) return; if (cur == NULL) return;
``` ```
3. **确定单层递归的逻辑**：前序遍历是中左右的循序，所以在单层递归的逻辑，是要先取中节点的数值，代码如下： 3. **确定单层递归的逻辑**：前序遍历是中左右的循序，所以在单层递归的逻辑，是要先取中节点的数值，代码如下：
``` ```cpp
vec.push_back(cur->val); // 中 vec.push_back(cur->val); // 中
traversal(cur->left, vec); // 左 traversal(cur->left, vec); // 左
traversal(cur->right, vec); // 右 traversal(cur->right, vec); // 右

47
problems/剑指Offer05.替换空格.md
View File

@ -121,6 +121,37 @@ for (int i = 0; i < a.size(); i++) {
## 其他语言版本 ## 其他语言版本
C：
```C
char* replaceSpace(char* s){
//统计空格数量
int count = 0;
int len = strlen(s);
for (int i = 0; i < len; i++) {
if (s[i] == ' ') {
count++;
}
}
//为新数组分配空间
int newLen = len + count * 2;
char* result = malloc(sizeof(char) * newLen + 1);
//填充新数组并替换空格
for (int i = len - 1, j = newLen - 1; i >= 0; i--, j--) {
if (s[i] != ' ') {
result[j] = s[i];
} else {
result[j--] = '0';
result[j--] = '2';
result[j] = '%';
}
}
result[newLen] = '\0';
return result;
}
```
Java： Java：
```Java ```Java
@ -260,8 +291,24 @@ class Solution:
``` ```
```python
class Solution:
def replaceSpace(self, s: str) -> str:
# method 1 - Very rude
return "%20".join(s.split(" "))
# method 2 - Reverse the s when counting in for loop, then update from the end.
n = len(s)
for e, i in enumerate(s[::-1]):
print(i, e)
if i == " ":
s = s[: n - (e + 1)] + "%20" + s[n - e:]
print("")
return s
```
javaScript: javaScript:
```js ```js
/** /**
* @param {string} s * @param {string} s

87
problems/背包问题理论基础多重背包.md
View File

@ -245,7 +245,94 @@ if __name__ == '__main__':
Go： Go：
```go
package theory
import "log"
// 多重背包可以化解为 01 背包
func multiplePack(weight, value, nums []int, bagWeight int) int {
for i := 0; i < len(nums); i++ {
for nums[i] > 1 {
weight = append(weight, weight[i])
value = append(value, value[i])
nums[i]--
}
}
log.Println(weight)
log.Println(value)
res := make([]int, bagWeight+1)
for i := 0; i < len(weight); i++ {
for j := bagWeight; j >= weight[i]; j-- {
res[j] = getMax(res[j], res[j-weight[i]]+value[i])
}
log.Println(res)
}
return res[bagWeight]
}
```
> 单元测试
```go
package theory
import "testing"
func Test_multiplePack(t *testing.T) {
type args struct {
weight []int
value []int
nums []int
bagWeight int
}
tests := []struct {
name string
args args
want int
}{
{
name: "one",
args: args{
weight: []int{1, 3, 4},
value: []int{15, 20, 30},
nums: []int{2, 3, 2},
bagWeight: 10,
},
want: 90,
},
}
for _, tt := range tests {
t.Run(tt.name, func(t *testing.T) {
if got := multiplePack(tt.args.weight, tt.args.value, tt.args.nums, tt.args.bagWeight); got != tt.want {
t.Errorf("multiplePack() = %v, want %v", got, tt.want)
}
})
}
}
```
> 输出
```
=== RUN Test_multiplePack
=== RUN Test_multiplePack/one
2022/03/02 21:09:05 [1 3 4 1 3 3 4]
2022/03/02 21:09:05 [15 20 30 15 20 20 30]
2022/03/02 21:09:05 [0 15 15 15 15 15 15 15 15 15 15]
2022/03/02 21:09:05 [0 15 15 20 35 35 35 35 35 35 35]
2022/03/02 21:09:05 [0 15 15 20 35 45 45 50 65 65 65]
2022/03/02 21:09:05 [0 15 30 30 35 50 60 60 65 80 80]
2022/03/02 21:09:05 [0 15 30 30 35 50 60 60 70 80 80]
2022/03/02 21:09:05 [0 15 30 30 35 50 60 60 70 80 80]
2022/03/02 21:09:05 [0 15 30 30 35 50 60 60 70 80 90]
--- PASS: Test_multiplePack (0.00s)
--- PASS: Test_multiplePack/one (0.00s)
PASS
```
----------------------- -----------------------