algorithm/LeetCode-Go
1
0
Fork 0
mirror of https://github.com/halfrost/LeetCode-Go.git synced 2025-07-09 12:23:15 +08:00
Code Issues Packages Projects Releases Wiki Activity

更新目录

Browse Source
This commit is contained in:
YDZ
2019-07-23 18:10:01 +08:00
parent 73b73f0e68
commit b8807fd96c
1 changed files with 9 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files

14
README.md
View File

@ -505,7 +505,7 @@
| 0438 | Find All Anagrams in a String | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0438.%20Find%20All%20Anagrams%20in%20a%20String) | 37.50% | Easy | |
| 0439 | Ternary Expression Parser | | 53.70% | Medium | |
| 0440 | K-th Smallest in Lexicographical Order | | 26.60% | Hard | |
| 0441 | Arranging Coins | | 38.10% | Easy | |
| 0441 | Arranging Coins |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0441.%20Arranging%20Coins) | 38.10% | Easy | |
| 0442 | Find All Duplicates in an Array | | 61.30% | Medium | |
| 0443 | String Compression | | 37.90% | Easy | |
| 0444 | Sequence Reconstruction | | 20.50% | Medium | |
@ -521,7 +521,7 @@
| 0454 | 4Sum II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0454.%204Sum%20II) | 50.80% | Medium | |
| 0455 | Assign Cookies | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0455.%20Assign%20Cookies) | 48.50% | Easy | |
| 0456 | 132 Pattern | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0456.%20132%20Pattern) | 27.40% | Medium | |
| 0457 | Circular Array Loop | | 27.70% | Medium | |
| 0457 | Circular Array Loop |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0457.%20Circular%20Array%20Loop) | 27.70% | Medium | |
| 0458 | Poor Pigs | | 45.50% | Hard | |
| 0459 | Repeated Substring Pattern | | 40.00% | Easy | |
| 0460 | LFU Cache | | 29.00% | Hard | |
@ -845,7 +845,7 @@
| 0778 | Swim in Rising Water | | 47.80% | Hard | |
| 0779 | K-th Symbol in Grammar | | 37.50% | Medium | |
| 0780 | Reaching Points | | 27.60% | Hard | |
| 0781 | Rabbits in Forest | | 51.80% | Medium | |
| 0781 | Rabbits in Forest |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0781.%20Rabbits%20in%20Forest) | 51.80% | Medium | |
| 0782 | Transform to Chessboard | | 39.80% | Hard | |
| 0783 | Minimum Distance Between BST Nodes | | 50.60% | Easy | |
| 0784 | Letter Case Permutation | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0784.%20Letter%20Case%20Permutation) | 57.40% | Easy | |
@ -1048,7 +1048,7 @@
| 0981 | Time Based Key-Value Store | | 50.80% | Medium | |
| 0982 | Triples with Bitwise AND Equal To Zero | | 54.00% | Hard | |
| 0983 | Minimum Cost For Tickets | | 57.30% | Medium | |
| 0984 | String Without AAA or BBB | | 33.90% | Medium | |
| 0984 | String Without AAA or BBB |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0984.%20String%20Without%20AAA%20or%20BBB) | 33.90% | Medium | |
| 0985 | Sum of Even Numbers After Queries | | 63.40% | Easy | |
| 0986 | Interval List Intersections | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0986.%20Interval%20List%20Intersections) | 63.30% | Medium | |
| 0987 | Vertical Order Traversal of a Binary Tree | | 31.80% | Medium | |
@ -1192,6 +1192,10 @@
| 1125 | Smallest Sufficient Team     | | 43.50% | Hard | |
| 1126 | Active Businesses     | | 70.80% | Medium | |
| 1127 | User Purchase Platform     | | 64.50% | Hard | |
| 1128 | Number of Equivalent Domino Pairs     | | 40.30% | Easy | |
| 1129 | Shortest Path with Alternating Colors | | 34.20% | Medium | |
| 1130 | Minimum Cost Tree From Leaf Values | | 56.30% | Medium | |
| 1131 | Maximum of Absolute Value Expression | | 48.20% | Medium | |
|------------|-------------------------------------------------------|-------| ----------------| ---------------|-------------|
@ -1886,7 +1890,7 @@ func updateMatrix_BFS(matrix [][]int) [][]int {
|[148. Sort List](https://leetcode.com/problems/sort-list/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0148.%20Sort%20List)| Medium |O(n log n)| O(log n)|❤️|
|[164. Maximum Gap](https://leetcode.com/problems/maximum-gap/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0164.%20Maximum%20Gap)| Hard | O(n log n)| O(log n) |❤️|
|[179. Largest Number](https://leetcode.com/problems/largest-number/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0179.%20Largest%20Number)| Medium | O(n log n)| O(log n) |❤️|
|[220. Contains Duplicate III](https://leetcode.com/problems/contains-duplicate-iii/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0220.%20Contains%20Duplicate%20III)| Medium | O(n^2)| O(1) ||
|[220. Contains Duplicate III](https://leetcode.com/problems/contains-duplicate-iii/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0220.%20Contains%20Duplicate%20III)| Medium | O(n log n)| O(1) |❤️|
|[242. Valid Anagram](https://leetcode.com/problems/valid-anagram/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0242.%20Valid%20Anagram)| Easy | O(n)| O(n) ||
|[274. H-Index](https://leetcode.com/problems/h-index/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0274.%20H-Index)| Medium | O(n)| O(n) ||
|[324. Wiggle Sort II](https://leetcode.com/problems/wiggle-sort-ii/)| [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0324.%20Wiggle%20Sort%20II)| Medium| O(n)| O(n)|❤️|