Skip to content

Commit 35b3416

Browse files
iostalksiostalks
committed
update readme
1 parent 3192e6a commit 35b3416

File tree

19 files changed

+76
-46
lines changed

19 files changed

+76
-46
lines changed

‎BackTracking/01.N-Queens/README.md

Lines changed: 6 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,10 @@
11
# N-Queens（N 皇后）
2-
LeetCode 51
3-
[English](https://leetcode.com/problems/n-queens/)
4-
[中文](https://leetcode-cn.com/problems/n-queens/)
2+
3+
**LeetCode 51**
4+
5+
- [英文版](https://leetcode.com/problems/n-queens/)
6+
7+
- [中文版](https://leetcode-cn.com/problems/n-queens/)
58

69
## 题目
710
n 皇后问题研究的是如何将 n 个皇后放置在 n×n 的棋盘上，并且使皇后彼此之间不能相互攻击。

‎BackTracking/02.Permutations/README.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
# Permutations （全排列）
22

3-
LeetCode 46
3+
**LeetCode 46**
44

55
- [英文版](https://leetcode.com/problems/permutations/)
66

‎BackTracking/03.RegularExpressingMatching/README.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,8 +1,8 @@
11
# Regular Expression Matching（正则表达式匹配）
22

3-
LeetCode 10
3+
**LeetCode 10**
44

5-
- [英文版]()
5+
- [英文版](https://leetcode.com/problems/regular-expression-matching/)
66

77
- [中文版](https://leetcode-cn.com/problems/regular-expression-matching/)
88

‎DynamicProgramming/02.CoinChange/README.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
# Coin Change （零钱兑换）
22

3-
LeetCode 322
3+
**LeetCode 322**
44

55
- [英文版](https://leetcode.com/problems/coin-change/)
66

‎DynamicProgramming/03.BuyAndSellStock/README.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
# Best Time to Buy and Sell Stock（买卖股票的最佳时机）
22

3-
LeetCode 121
3+
**LeetCode 121**
44

55
- [英文版](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/)
66

‎DynamicProgramming/04.MaximumProductSubarray/README.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
1-
# Maximum Product Subarray
1+
# Maximum Product Subarray（乘积最大子序列）
22

3-
LeetCode 152
3+
**LeetCode 152**
44

55
- [英文版](https://leetcode.com/problems/maximum-product-subarray/)
66

‎DynamicProgramming/06.Triangle/README.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
# Triangle（三角形最小路径和）
22

3-
LeetCode 120
3+
**LeetCode 120**
44

55
- [英文版](https://leetcode.com/problems/triangle/)
66

‎Graph/01.NumberOfIslands/README.md

Lines changed: 6 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,10 @@
11
# Number of Islands（岛屿的个数）
2-
LeetCode 200
3-
[English](https://leetcode.com/problems/number-of-islands/description/)
4-
[中文](https://leetcode-cn.com/problems/number-of-islands/description/)
2+
3+
**LeetCode 200**
4+
5+
- [英文版](https://leetcode.com/problems/number-of-islands/description/)
6+
7+
- [中文版](https://leetcode-cn.com/problems/number-of-islands/description/)
58

69
## 题目
710
给定一个由 '1'（陆地）和 '0'（水）组成的的二维网格，计算岛屿的数量。一个岛被水包围，并且它是通过水平方向或垂直方向上相邻的陆地连接而成的。你可以假设网格的四个边均被水包围。

‎Graph/02.ValidSudoku/README.md

Lines changed: 6 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,10 @@
11
# Valid Sudoku（有效的数独）
2-
LeetCode 36
3-
[English](https://leetcode.com/problems/valid-sudoku/)
4-
[中文](https://leetcode-cn.com/problems/valid-sudoku/)
2+
3+
**LeetCode 36**
4+
5+
- [英文版](https://leetcode.com/problems/valid-sudoku/)
6+
7+
- [中文](https://leetcode-cn.com/problems/valid-sudoku/)
58

69
## 题目
710

‎Search/01.LowestCommonAncestor/README.md

Lines changed: 6 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,10 @@
11
# Lowest Common Ancestor of a Binary Search Tree（二叉搜索树的最近公共祖先）
2-
LeetCode 235
3-
[English](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/)
4-
[中文](https://leetcode-cn.com/problems/lowest-common-ancestor-of-a-binary-search-tree/)
2+
3+
**LeetCode 235**
4+
5+
- [英文版](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/)
6+
7+
- [中文版](https://leetcode-cn.com/problems/lowest-common-ancestor-of-a-binary-search-tree/)
58

69
## 题目
710

0 commit comments

Comments
 (0)