diff --git a/README.md b/README.md index afc285ccd..8eb5bb0c6 100644 --- a/README.md +++ b/README.md @@ -54,6 +54,10 @@ LeetCode Problems' Solutions | # | Title | Solution | Difficulty | | :-: | - | - | :-: | +| 1131 | [Maximum of Absolute Value Expression](https://leetcode.com/problems/maximum-of-absolute-value-expression "绝对值表达式的最大值") | [Go](https://github.com/openset/leetcode/tree/master/problems/maximum-of-absolute-value-expression) | Medium | +| 1130 | [Minimum Cost Tree From Leaf Values](https://leetcode.com/problems/minimum-cost-tree-from-leaf-values "叶值的最小代价生成树") | [Go](https://github.com/openset/leetcode/tree/master/problems/minimum-cost-tree-from-leaf-values) | Medium | +| 1129 | [Shortest Path with Alternating Colors](https://leetcode.com/problems/shortest-path-with-alternating-colors "颜色交替的最短路径") | [Go](https://github.com/openset/leetcode/tree/master/problems/shortest-path-with-alternating-colors) | Medium | +| 1128 | [Number of Equivalent Domino Pairs](https://leetcode.com/problems/number-of-equivalent-domino-pairs "等价多米诺骨牌对的数量") | [Go](https://github.com/openset/leetcode/tree/master/problems/number-of-equivalent-domino-pairs) | Easy | | 1127 | [User Purchase Platform](https://leetcode.com/problems/user-purchase-platform) 🔒 | [MySQL](https://github.com/openset/leetcode/tree/master/problems/user-purchase-platform) | Hard | | 1126 | [Active Businesses](https://leetcode.com/problems/active-businesses) 🔒 | [MySQL](https://github.com/openset/leetcode/tree/master/problems/active-businesses) | Medium | | 1125 | [Smallest Sufficient Team](https://leetcode.com/problems/smallest-sufficient-team "最小的必要团队") | [Go](https://github.com/openset/leetcode/tree/master/problems/smallest-sufficient-team) | Hard | diff --git a/problems/best-time-to-buy-and-sell-stock-ii/README.md b/problems/best-time-to-buy-and-sell-stock-ii/README.md index a379f0e32..4257b8cc1 100644 --- a/problems/best-time-to-buy-and-sell-stock-ii/README.md +++ b/problems/best-time-to-buy-and-sell-stock-ii/README.md @@ -44,8 +44,8 @@ Explanation: In this case, no transaction is done, i.e. max profit = 0. ### Related Topics - [[Greedy](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Greedy](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] ### Similar Questions 1. [Best Time to Buy and Sell Stock](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock) (Easy) diff --git a/problems/insertion-sort-list/README.md b/problems/insertion-sort-list/README.md index ccb768d9d..72eff798a 100644 --- a/problems/insertion-sort-list/README.md +++ b/problems/insertion-sort-list/README.md @@ -48,8 +48,8 @@ With each iteration one element (red) is removed from the input data and inserte ### Related Topics - [[Sort](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[Linked List](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] + [[Sort](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] ### Similar Questions 1. [Sort List](https://github.com/openset/leetcode/tree/master/problems/sort-list) (Medium) diff --git a/problems/sort-list/README.md b/problems/sort-list/README.md index 46456c7b3..22cf9683f 100644 --- a/problems/sort-list/README.md +++ b/problems/sort-list/README.md @@ -27,8 +27,8 @@ Output: -1->0->3->4->5 ### Related Topics - [[Sort](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[Linked List](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] + [[Sort](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] ### Similar Questions 1. [Merge Two Sorted Lists](https://github.com/openset/leetcode/tree/master/problems/merge-two-sorted-lists) (Easy) diff --git a/problems/user-purchase-platform/README.md b/problems/user-purchase-platform/README.md index cad107d76..5a19c3e3d 100644 --- a/problems/user-purchase-platform/README.md +++ b/problems/user-purchase-platform/README.md @@ -7,7 +7,7 @@ [< Previous](https://github.com/openset/leetcode/tree/master/problems/active-businesses "Active Businesses") 　　　　　　　　　　　　　　　　 -Next > +[Next >](https://github.com/openset/leetcode/tree/master/problems/number-of-equivalent-domino-pairs "Number of Equivalent Domino Pairs") ## 1127. User Purchase Platform (Hard)