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

更新目录

Browse Source
This commit is contained in:
YDZ
2019-09-22 17:12:13 +08:00
parent 7fb4e8aba9
commit 47bc5f5ab8
1 changed files with 10 additions and 10 deletions
Download Patch File Download Diff File Expand all files Collapse all files

20
README.md
View File

@ -92,11 +92,11 @@
| 0026 | Remove Duplicates from Sorted Array | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0026.%20Remove%20Duplicates%20from%20Sorted%20Array) | 41.00% | Easy | |
| 0027 | Remove Element | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0027.%20Remove%20Element) | 44.80% | Easy | |
| 0028 | Implement strStr() | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0028.%20Implement%20strStr()) | 32.20% | Easy | |
| 0029 | Divide Two Integers | | 16.10% | Medium | |
| 0029 | Divide Two Integers | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0029.%20Divide%20Two%20Integers) | 16.10% | Medium | |
| 0030 | Substring with Concatenation of All Words | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0030.%20Substring%20with%20Concatenation%20of%20All%20Words)(是否还有更优解) | 23.70% | Hard | |
| 0031 | Next Permutation | | 30.60% | Medium | |
| 0032 | Longest Valid Parentheses | | 25.70% | Hard | |
| 0033 | Search in Rotated Sorted Array | | 33.00% | Medium | |
| 0033 | Search in Rotated Sorted Array | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0033.%20Search%20in%20Rotated%20Sorted%20Array) | 33.00% | Medium | |
| 0034 | Find First and Last Position of Element in Sorted Array | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0034.%20Find%20First%20and%20Last%20Position%20of%20Element%20in%20Sorted%20Array) | 33.70% | Medium | |
| 0035 | Search Insert Position | | 40.90% | Easy | |
| 0036 | Valid Sudoku | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0036.%20Valid%20Sudoku) | 43.50% | Medium | |
@ -366,11 +366,11 @@
| 0300 | Longest Increasing Subsequence | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0300.%20Longest%20Increasing%20Subsequence) | 41.00% | Medium | |
| 0301 | Remove Invalid Parentheses | | 39.50% | Hard | |
| 0302 | Smallest Rectangle Enclosing Black Pixels | | 49.40% | Hard | |
| 0303 | Range Sum Query - Immutable | | 38.40% | Easy | |
| 0303 | Range Sum Query - Immutable | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0303.%20Range%20Sum%20Query%20-%20Immutable) | 38.40% | Easy | |
| 0304 | Range Sum Query 2D - Immutable | | 32.70% | Medium | |
| 0305 | Number of Islands II | | 41.70% | Hard | |
| 0306 | Additive Number | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0306.%20Additive%20Number) | 28.40% | Medium | |
| 0307 | Range Sum Query - Mutable | | 29.00% | Medium | |
| 0307 | Range Sum Query - Mutable | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0307.%20Range%20Sum%20Query%20-%20Mutable) | 29.00% | Medium | |
| 0308 | Range Sum Query 2D - Mutable | | 32.20% | Hard | |
| 0309 | Best Time to Buy and Sell Stock with Cooldown | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0309.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock%20with%20Cooldown) | 44.20% | Medium | |
| 0310 | Minimum Height Trees | | 30.30% | Medium | |
@ -378,7 +378,7 @@
| 0312 | Burst Balloons | | 47.50% | Hard | |
| 0313 | Super Ugly Number | | 41.70% | Medium | |
| 0314 | Binary Tree Vertical Order Traversal | | 41.20% | Medium | |
| 0315 | Count of Smaller Numbers After Self | | 38.40% | Hard | |
| 0315 | Count of Smaller Numbers After Self | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0315.%20Count%20of%20Smaller%20Numbers%20After%20Self) | 38.40% | Hard | |
| 0316 | Remove Duplicate Letters | | 32.80% | Hard | |
| 0317 | Shortest Distance from All Buildings | | 38.10% | Hard | |
| 0318 | Maximum Product of Word Lengths |[Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0318.%20Maximum%20Product%20of%20Word%20Lengths) | 48.70% | Medium | |
@ -390,7 +390,7 @@
| 0324 | Wiggle Sort II | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0324.%20Wiggle%20Sort%20II) | 28.10% | Medium | |
| 0325 | Maximum Size Subarray Sum Equals k | | 44.80% | Medium | |
| 0326 | Power of Three | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0326.%20Power%20of%20Three) | 41.70% | Easy | |
| 0327 | Count of Range Sum | | 32.90% | Hard | |
| 0327 | Count of Range Sum | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0327.%20Count%20of%20Range%20Sum) | 32.90% | Hard | |
| 0328 | Odd Even Linked List | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0328.%20Odd%20Even%20Linked%20List) | 49.50% | Medium | |
| 0329 | Longest Increasing Path in a Matrix | | 40.30% | Hard | |
| 0330 | Patching Array | | 33.40% | Hard | |
@ -557,7 +557,7 @@
| 0490 | The Maze | | 47.60% | Medium | |
| 0491 | Increasing Subsequences | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0491.%20Increasing%20Subsequences) | 42.20% | Medium | |
| 0492 | Construct the Rectangle | | 48.80% | Easy | |
| 0493 | Reverse Pairs | | 23.30% | Hard | |
| 0493 | Reverse Pairs | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0493.%20Reverse%20Pairs) | 23.30% | Hard | |
| 0494 | Target Sum | | 45.40% | Medium | |
| 0495 | Teemo Attacking | | 52.30% | Medium | |
| 0496 | Next Greater Element I | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0496.%20Next%20Greater%20Element%20I) | 59.80% | Easy | |
@ -763,7 +763,7 @@
| 0696 | Count Binary Substrings | | 53.60% | Easy | |
| 0697 | Degree of an Array | | 50.60% | Easy | |
| 0698 | Partition to K Equal Sum Subsets | | 42.50% | Medium | |
| 0699 | Falling Squares | | 40.10% | Hard | |
| 0699 | Falling Squares | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0699.%20Falling%20Squares) | 40.10% | Hard | |
| 0700 | Search in a Binary Search Tree | | 68.60% | Easy | |
| 0701 | Insert into a Binary Search Tree | | 76.10% | Medium | |
| 0702 | Search in a Sorted Array of Unknown Size | | 59.30% | Medium | |
@ -779,7 +779,7 @@
| 0712 | Minimum ASCII Delete Sum for Two Strings | | 54.80% | Medium | |
| 0713 | Subarray Product Less Than K | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0713.%20Subarray%20Product%20Less%20Than%20K) | 36.80% | Medium | |
| 0714 | Best Time to Buy and Sell Stock with Transaction Fee | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0714.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock%20with%20Transaction%20Fee) | 50.60% | Medium | |
| 0715 | Range Module | | 35.70% | Hard | |
| 0715 | Range Module | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0715.%20Range%20Module) | 35.70% | Hard | |
| 0716 | Max Stack | | 40.20% | Easy | |
| 0717 | 1-bit and 2-bit Characters | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0717.%201-bit%20and%202-bit%20Characters) | 49.20% | Easy | |
| 0718 | Maximum Length of Repeated Subarray | | 46.30% | Medium | |
@ -796,7 +796,7 @@
| 0729 | My Calendar I | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0729.%20My%20Calendar%20I) | 47.60% | Medium | |
| 0730 | Count Different Palindromic Subsequences | | 39.20% | Hard | |
| 0731 | My Calendar II | | 44.80% | Medium | |
| 0732 | My Calendar III | | 55.20% | Hard | |
| 0732 | My Calendar III | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0732.%20My%20Calendar%20III) | 55.20% | Hard | |
| 0733 | Flood Fill | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0733.%20Flood%20Fill) | 51.10% | Easy | |
| 0734 | Sentence Similarity | | 40.80% | Easy | |
| 0735 | Asteroid Collision | [Go](https://github.com/halfrost/LeetCode-Go/tree/master/Algorithms/0735.%20Asteroid%20Collision) | 38.60% | Medium | |