Skip to content
This repository has been archived by the owner on Sep 20, 2023. It is now read-only.

Commit

Permalink
更新 README.md
Browse files Browse the repository at this point in the history
  • Loading branch information
aQua authored and aQua committed Jun 15, 2018
1 parent 01ff2c8 commit cf61b35
Show file tree
Hide file tree
Showing 3 changed files with 46 additions and 44 deletions.
4 changes: 3 additions & 1 deletion .gitignore
Expand Up @@ -21,4 +21,6 @@ testDir/
coverage.txt

# 删除 Goland 设置
.idea
.idea

.orig
44 changes: 22 additions & 22 deletions README.md
@@ -1,6 +1,6 @@
# [LeetCode](https://leetcode.com) 的 Go 解答

[![LeetCode 排名](https://img.shields.io/badge/aQuaYi-990-blue.svg)](https://leetcode.com/aQuaYi/)
[![LeetCode 排名](https://img.shields.io/badge/aQuaYi-995-blue.svg)](https://leetcode.com/aQuaYi/)
[![codecov](https://codecov.io/gh/aQuaYi/LeetCode-in-Go/branch/master/graph/badge.svg)](https://codecov.io/gh/aQuaYi/LeetCode-in-Go)
[![Build Status](https://www.travis-ci.org/aQuaYi/LeetCode-in-Go.svg?branch=master)](https://www.travis-ci.org/aQuaYi/LeetCode-in-Go)

Expand All @@ -10,7 +10,7 @@
| |Easy|Medium|Hard|Total|
|:---:|:---:|:---:|:---:|:---:|
|**Accepted**|173|299|127|599|
|**Accepted**|174|299|127|600|
|**Total**|175|303|131|609|

## 题解
Expand Down Expand Up @@ -93,7 +93,7 @@
|74|[Search a 2D Matrix](./Algorithms/0074.search-a-2d-matrix)|34%|Medium||
|75|[Sort Colors](./Algorithms/0075.sort-colors)|39%|Medium|[](https://leetcode.com/list/oussv5j)|
|76|[Minimum Window Substring](./Algorithms/0076.minimum-window-substring)|27%|Hard|[](https://leetcode.com/list/oussv5j)|
|77|[Combinations](./Algorithms/0077.combinations)|41%|Medium||
|77|[Combinations](./Algorithms/0077.combinations)|42%|Medium||
|78|[Subsets](./Algorithms/0078.subsets)|45%|Medium|[](https://leetcode.com/list/oussv5j)|
|79|[Word Search](./Algorithms/0079.word-search)|28%|Medium||
|80|[Remove Duplicates from Sorted Array II](./Algorithms/0080.remove-duplicates-from-sorted-array-ii)|37%|Medium|[](https://leetcode.com/list/oussv5j)|
Expand Down Expand Up @@ -265,13 +265,13 @@
|334|[Increasing Triplet Subsequence](./Algorithms/0334.increasing-triplet-subsequence)|39%|Medium|[](https://leetcode.com/list/oussv5j)|
|335|[Self Crossing](./Algorithms/0335.self-crossing)|26%|Hard||
|336|[Palindrome Pairs](./Algorithms/0336.palindrome-pairs)|27%|Hard|[](https://leetcode.com/list/oussv5j)|
|337|[House Robber III](./Algorithms/0337.house-robber-iii)|44%|Medium|[](https://leetcode.com/list/oussv5j)|
|337|[House Robber III](./Algorithms/0337.house-robber-iii)|45%|Medium|[](https://leetcode.com/list/oussv5j)|
|338|[Counting Bits](./Algorithms/0338.counting-bits)|62%|Medium||
|342|[Power of Four](./Algorithms/0342.power-of-four)|39%|Easy||
|343|[Integer Break](./Algorithms/0343.integer-break)|46%|Medium||
|344|[Reverse String](./Algorithms/0344.reverse-string)|60%|Easy||
|345|[Reverse Vowels of a String](./Algorithms/0345.reverse-vowels-of-a-string)|39%|Easy||
|347|[Top K Frequent Elements](./Algorithms/0347.top-k-frequent-elements)|49%|Medium||
|347|[Top K Frequent Elements](./Algorithms/0347.top-k-frequent-elements)|50%|Medium||
|349|[Intersection of Two Arrays](./Algorithms/0349.intersection-of-two-arrays)|48%|Easy||
|350|[Intersection of Two Arrays II](./Algorithms/0350.intersection-of-two-arrays-ii)|44%|Easy|[](https://leetcode.com/list/oussv5j)|
|352|[Data Stream as Disjoint Intervals](./Algorithms/0352.data-stream-as-disjoint-intervals)|41%|Hard||
Expand Down Expand Up @@ -409,7 +409,7 @@
|540|[Single Element in a Sorted Array](./Algorithms/0540.single-element-in-a-sorted-array)|55%|Medium||
|541|[Reverse String II](./Algorithms/0541.reverse-string-ii)|43%|Easy||
|542|[01 Matrix](./Algorithms/0542.01-matrix)|33%|Medium|[](https://leetcode.com/list/oussv5j)|
|543|[Diameter of Binary Tree](./Algorithms/0543.diameter-of-binary-tree)|44%|Easy||
|543|[Diameter of Binary Tree](./Algorithms/0543.diameter-of-binary-tree)|45%|Easy||
|546|[Remove Boxes](./Algorithms/0546.remove-boxes)|36%|Hard|[](https://leetcode.com/list/oussv5j)|
|547|[Friend Circles](./Algorithms/0547.friend-circles)|49%|Medium|[](https://leetcode.com/list/oussv5j)|
|551|[Student Attendance Record I](./Algorithms/0551.student-attendance-record-i)|44%|Easy||
Expand All @@ -431,9 +431,9 @@
|581|[Shortest Unsorted Continuous Subarray](./Algorithms/0581.shortest-unsorted-continuous-subarray)|29%|Easy|[](https://leetcode.com/list/oussv5j)|
|583|[Delete Operation for Two Strings](./Algorithms/0583.delete-operation-for-two-strings)|44%|Medium|[](https://leetcode.com/list/oussv5j)|
|587|[Erect the Fence](./Algorithms/0587.erect-the-fence)|33%|Hard|[](https://leetcode.com/list/oussv5j)|
|591|[Tag Validator](./Algorithms/0591.tag-validator)|31%|Hard|[](https://leetcode.com/list/oussv5j)|
|591|[Tag Validator](./Algorithms/0591.tag-validator)|30%|Hard|[](https://leetcode.com/list/oussv5j)|
|592|[Fraction Addition and Subtraction](./Algorithms/0592.fraction-addition-and-subtraction)|46%|Medium||
|593|[Valid Square](./Algorithms/0593.valid-square)|39%|Medium||
|593|[Valid Square](./Algorithms/0593.valid-square)|40%|Medium||
|594|[Longest Harmonious Subsequence](./Algorithms/0594.longest-harmonious-subsequence)|41%|Easy||
|598|[Range Addition II](./Algorithms/0598.range-addition-ii)|48%|Easy||
|599|[Minimum Index Sum of Two Lists](./Algorithms/0599.minimum-index-sum-of-two-lists)|46%|Easy||
Expand Down Expand Up @@ -477,11 +477,11 @@
|668|[Kth Smallest Number in Multiplication Table](./Algorithms/0668.kth-smallest-number-in-multiplication-table)|40%|Hard||
|669|[Trim a Binary Search Tree](./Algorithms/0669.trim-a-binary-search-tree)|58%|Easy||
|670|[Maximum Swap](./Algorithms/0670.maximum-swap)|38%|Medium|[](https://leetcode.com/list/oussv5j)|
|671|[Second Minimum Node In a Binary Tree](./Algorithms/0671.second-minimum-node-in-a-binary-tree)|41%|Easy||
|671|[Second Minimum Node In a Binary Tree](./Algorithms/0671.second-minimum-node-in-a-binary-tree)|42%|Easy||
|672|[Bulb Switcher II](./Algorithms/0672.bulb-switcher-ii)|49%|Medium||
|673|[Number of Longest Increasing Subsequence](./Algorithms/0673.number-of-longest-increasing-subsequence)|31%|Medium|[](https://leetcode.com/list/oussv5j)|
|674|[Longest Continuous Increasing Subsequence](./Algorithms/0674.longest-continuous-increasing-subsequence)|42%|Easy||
|675|[Cut Off Trees for Golf Event](./Algorithms/0675.cut-off-trees-for-golf-event)|27%|Hard|[](https://leetcode.com/list/oussv5j)|
|675|[Cut Off Trees for Golf Event](./Algorithms/0675.cut-off-trees-for-golf-event)|26%|Hard|[](https://leetcode.com/list/oussv5j)|
|676|[Implement Magic Dictionary](./Algorithms/0676.implement-magic-dictionary)|49%|Medium||
|677|[Map Sum Pairs](./Algorithms/0677.map-sum-pairs)|51%|Medium|[](https://leetcode.com/list/oussv5j)|
|678|[Valid Parenthesis String](./Algorithms/0678.valid-parenthesis-string)|29%|Medium|[](https://leetcode.com/list/oussv5j)|
Expand All @@ -494,7 +494,7 @@
|687|[Longest Univalue Path](./Algorithms/0687.longest-univalue-path)|32%|Easy||
|688|[Knight Probability in Chessboard](./Algorithms/0688.knight-probability-in-chessboard)|40%|Medium||
|689|[Maximum Sum of 3 Non-Overlapping Subarrays](./Algorithms/0689.maximum-sum-of-3-non-overlapping-subarrays)|41%|Hard||
|691|[Stickers to Spell Word](./Algorithms/0691.stickers-to-spell-word)|34%|Hard|[](https://leetcode.com/list/oussv5j)|
|691|[Stickers to Spell Word](./Algorithms/0691.stickers-to-spell-word)|35%|Hard|[](https://leetcode.com/list/oussv5j)|
|692|[Top K Frequent Words](./Algorithms/0692.top-k-frequent-words)|41%|Medium||
|693|[Binary Number with Alternating Bits](./Algorithms/0693.binary-number-with-alternating-bits)|55%|Easy||
|695|[Max Area of Island](./Algorithms/0695.max-area-of-island)|52%|Easy|[](https://leetcode.com/list/oussv5j)|
Expand All @@ -505,7 +505,7 @@
|712|[Minimum ASCII Delete Sum for Two Strings](./Algorithms/0712.minimum-ascii-delete-sum-for-two-strings)|51%|Medium|[](https://leetcode.com/list/oussv5j)|
|713|[Subarray Product Less Than K](./Algorithms/0713.subarray-product-less-than-k)|33%|Medium|[](https://leetcode.com/list/oussv5j)|
|714|[Best Time to Buy and Sell Stock with Transaction Fee](./Algorithms/0714.best-time-to-buy-and-sell-stock-with-transaction-fee)|46%|Medium|[](https://leetcode.com/list/oussv5j)|
|715|[Range Module](./Algorithms/0715.range-module)|31%|Hard||
|715|[Range Module](./Algorithms/0715.range-module)|30%|Hard||
|717|[1-bit and 2-bit Characters](./Algorithms/0717.1-bit-and-2-bit-characters)|49%|Easy||
|718|[Maximum Length of Repeated Subarray](./Algorithms/0718.maximum-length-of-repeated-subarray)|41%|Medium|[](https://leetcode.com/list/oussv5j)|
|719|[Find K-th Smallest Pair Distance](./Algorithms/0719.find-k-th-smallest-pair-distance)|27%|Hard|[](https://leetcode.com/list/oussv5j)|
Expand All @@ -517,11 +517,11 @@
|726|[Number of Atoms](./Algorithms/0726.number-of-atoms)|43%|Hard|[](https://leetcode.com/list/oussv5j)|
|728|[Self Dividing Numbers](./Algorithms/0728.self-dividing-numbers)|66%|Easy||
|729|[My Calendar I](./Algorithms/0729.my-calendar-i)|42%|Medium||
|730|[Count Different Palindromic Subsequences](./Algorithms/0730.count-different-palindromic-subsequences)|34%|Hard|[](https://leetcode.com/list/oussv5j)|
|730|[Count Different Palindromic Subsequences](./Algorithms/0730.count-different-palindromic-subsequences)|35%|Hard|[](https://leetcode.com/list/oussv5j)|
|731|[My Calendar II](./Algorithms/0731.my-calendar-ii)|37%|Medium|[](https://leetcode.com/list/oussv5j)|
|732|[My Calendar III](./Algorithms/0732.my-calendar-iii)|49%|Hard||
|733|[Flood Fill](./Algorithms/0733.flood-fill)|47%|Easy||
|735|[Asteroid Collision](./Algorithms/0735.asteroid-collision)|36%|Medium||
|735|[Asteroid Collision](./Algorithms/0735.asteroid-collision)|37%|Medium||
|736|[Parse Lisp Expression](./Algorithms/0736.parse-lisp-expression)|41%|Hard|[](https://leetcode.com/list/oussv5j)|
|738|[Monotone Increasing Digits](./Algorithms/0738.monotone-increasing-digits)|41%|Medium||
|739|[Daily Temperatures](./Algorithms/0739.daily-temperatures)|53%|Medium|[](https://leetcode.com/list/oussv5j)|
Expand Down Expand Up @@ -559,7 +559,7 @@
|781|[Rabbits in Forest](./Algorithms/0781.rabbits-in-forest)|49%|Medium||
|782|[Transform to Chessboard](./Algorithms/0782.transform-to-chessboard)|37%|Hard||
|783|[Minimum Distance Between BST Nodes](./Algorithms/0783.minimum-distance-between-bst-nodes)|47%|Easy||
|784|[Letter Case Permutation](./Algorithms/0784.letter-case-permutation)|53%|Easy|[](https://leetcode.com/list/oussv5j)|
|784|[Letter Case Permutation](./Algorithms/0784.letter-case-permutation)|52%|Easy|[](https://leetcode.com/list/oussv5j)|
|785|[Is Graph Bipartite?](./Algorithms/0785.is-graph-bipartite)|38%|Medium|[](https://leetcode.com/list/oussv5j)|
|786|[K-th Smallest Prime Fraction](./Algorithms/0786.k-th-smallest-prime-fraction)|32%|Hard|[](https://leetcode.com/list/oussv5j)|
|787|[Cheapest Flights Within K Stops](./Algorithms/0787.cheapest-flights-within-k-stops)|29%|Medium|[](https://leetcode.com/list/oussv5j)|
Expand Down Expand Up @@ -594,22 +594,22 @@
|817|[Linked List Components](./Algorithms/0817.linked-list-components)|50%|Medium||
|818|[Race Car](./Algorithms/0818.race-car)|27%|Hard|[](https://leetcode.com/list/oussv5j)|
|819|[Most Common Word](./Algorithms/0819.most-common-word)|49%|Easy||
|820|[Short Encoding of Words](./Algorithms/0820.short-encoding-of-words)|40%|Medium|[](https://leetcode.com/list/oussv5j)|
|820|[Short Encoding of Words](./Algorithms/0820.short-encoding-of-words)|41%|Medium|[](https://leetcode.com/list/oussv5j)|
|821|[Shortest Distance to a Character](./Algorithms/0821.shortest-distance-to-a-character)|61%|Easy||
|822|[Card Flipping Game](./Algorithms/0822.card-flipping-game)|35%|Medium||
|823|[Binary Trees With Factors](./Algorithms/0823.binary-trees-with-factors)|28%|Medium||
|824|[Goat Latin](./Algorithms/0824.goat-latin)|55%|Easy||
|825|[Friends Of Appropriate Ages](./Algorithms/0825.friends-of-appropriate-ages)|27%|Medium||
|826|[Most Profit Assigning Work](./Algorithms/0826.most-profit-assigning-work)|31%|Medium|[](https://leetcode.com/list/oussv5j)|
|827|[Making A Large Island](./Algorithms/0827.making-a-large-island)|40%|Hard|[](https://leetcode.com/list/oussv5j)|
|827|[Making A Large Island](./Algorithms/0827.making-a-large-island)|41%|Hard|[](https://leetcode.com/list/oussv5j)|
|828|[Unique Letter String](./Algorithms/0828.unique-letter-string)|33%|Hard|[](https://leetcode.com/list/oussv5j)|
|829|[Consecutive Numbers Sum](./Algorithms/0829.consecutive-numbers-sum)|26%|Medium|[](https://leetcode.com/list/oussv5j)|
|830|[Positions of Large Groups](./Algorithms/0830.positions-of-large-groups)|47%|Easy||
|831|[Masking Personal Information](./Algorithms/0831.masking-personal-information)|42%|Medium||
|832|[Flipping an Image](./Algorithms/0832.flipping-an-image)|71%|Easy||
|833|[Find And Replace in String](./Algorithms/0833.find-and-replace-in-string)|37%|Medium||
|834|[Sum of Distances in Tree](./Algorithms/0834.sum-of-distances-in-tree)|30%|Hard|[](https://leetcode.com/list/oussv5j)|
|835|[Image Overlap](./Algorithms/0835.image-overlap)|34%|Medium||
|834|[Sum of Distances in Tree](./Algorithms/0834.sum-of-distances-in-tree)|31%|Hard|[](https://leetcode.com/list/oussv5j)|
|835|[Image Overlap](./Algorithms/0835.image-overlap)|35%|Medium||
|836|[Rectangle Overlap](./Algorithms/0836.rectangle-overlap)|40%|Easy||
|837|[New 21 Game](./Algorithms/0837.new-21-game)|25%|Medium|[](https://leetcode.com/list/oussv5j)|
|838|[Push Dominoes](./Algorithms/0838.push-dominoes)|39%|Medium|[](https://leetcode.com/list/oussv5j)|
Expand All @@ -618,14 +618,14 @@
|841|[Keys and Rooms](./Algorithms/0841.keys-and-rooms)|58%|Medium||
|842|[Split Array into Fibonacci Sequence](./Algorithms/0842.split-array-into-fibonacci-sequence)|34%|Medium||
|843| * Guess the Word|33%|Hard||
|844| * Backspace String Compare|48%|Easy||
|844|[Backspace String Compare](./Algorithms/0844.backspace-string-compare)|48%|Easy||
|845| * Longest Mountain in Array|30%|Medium||
|846| * Hand of Straights|42%|Medium||
|847| * Shortest Path Visiting All Nodes|38%|Hard||
|848| * Shifting Letters :new: |33%|Medium||
|849| * Maximize Distance to Closest Person :new: |40%|Easy||
|850| * Rectangle Area II :new: |41%|Hard||
|851| * Loud and Rich :new: |41%|Medium||
|850| * Rectangle Area II :new: |42%|Hard||
|851| * Loud and Rich :new: |42%|Medium||

以下免费的算法题,暂时不能使用 Go 解答

Expand Down
42 changes: 21 additions & 21 deletions leetcode.json
@@ -1,10 +1,10 @@
{
"Username": "aQuaYi",
"Ranking": 995,
"Updated": "2018-06-15T11:37:16.796549267+08:00",
"Updated": "2018-06-15T14:08:15.446468171+08:00",
"Record": {
"Easy": {
"Solved": 173,
"Solved": 174,
"Total": 175
},
"Medium": {
Expand All @@ -16,7 +16,7 @@
"Total": 131
},
"Total": {
"Solved": 599,
"Solved": 600,
"Total": 609
}
},
Expand Down Expand Up @@ -949,7 +949,7 @@
"ID": 77,
"Title": "Combinations",
"TitleSlug": "combinations",
"PassRate": "41%",
"PassRate": "42%",
"Difficulty": "Medium",
"IsAccepted": true,
"IsPaid": false,
Expand Down Expand Up @@ -4069,7 +4069,7 @@
"ID": 337,
"Title": "House Robber III",
"TitleSlug": "house-robber-iii",
"PassRate": "44%",
"PassRate": "45%",
"Difficulty": "Medium",
"IsAccepted": true,
"IsPaid": false,
Expand Down Expand Up @@ -4189,7 +4189,7 @@
"ID": 347,
"Title": "Top K Frequent Elements",
"TitleSlug": "top-k-frequent-elements",
"PassRate": "49%",
"PassRate": "50%",
"Difficulty": "Medium",
"IsAccepted": true,
"IsPaid": false,
Expand Down Expand Up @@ -7141,7 +7141,7 @@
"ID": 593,
"Title": "Valid Square",
"TitleSlug": "valid-square",
"PassRate": "39%",
"PassRate": "40%",
"Difficulty": "Medium",
"IsAccepted": true,
"IsPaid": false,
Expand Down Expand Up @@ -8077,7 +8077,7 @@
"ID": 671,
"Title": "Second Minimum Node In a Binary Tree",
"TitleSlug": "second-minimum-node-in-a-binary-tree",
"PassRate": "41%",
"PassRate": "42%",
"Difficulty": "Easy",
"IsAccepted": true,
"IsPaid": false,
Expand Down Expand Up @@ -8125,7 +8125,7 @@
"ID": 675,
"Title": "Cut Off Trees for Golf Event",
"TitleSlug": "cut-off-trees-for-golf-event",
"PassRate": "27%",
"PassRate": "26%",
"Difficulty": "Hard",
"IsAccepted": true,
"IsPaid": false,
Expand Down Expand Up @@ -8317,7 +8317,7 @@
"ID": 691,
"Title": "Stickers to Spell Word",
"TitleSlug": "stickers-to-spell-word",
"PassRate": "34%",
"PassRate": "35%",
"Difficulty": "Hard",
"IsAccepted": true,
"IsPaid": false,
Expand Down Expand Up @@ -8605,7 +8605,7 @@
"ID": 715,
"Title": "Range Module",
"TitleSlug": "range-module",
"PassRate": "31%",
"PassRate": "30%",
"Difficulty": "Hard",
"IsAccepted": true,
"IsPaid": false,
Expand All @@ -8617,7 +8617,7 @@
"ID": 716,
"Title": "Max Stack",
"TitleSlug": "max-stack",
"PassRate": "36%",
"PassRate": "37%",
"Difficulty": "Hard",
"IsAccepted": false,
"IsPaid": true,
Expand Down Expand Up @@ -8785,7 +8785,7 @@
"ID": 730,
"Title": "Count Different Palindromic Subsequences",
"TitleSlug": "count-different-palindromic-subsequences",
"PassRate": "34%",
"PassRate": "35%",
"Difficulty": "Hard",
"IsAccepted": true,
"IsPaid": false,
Expand Down Expand Up @@ -8845,7 +8845,7 @@
"ID": 735,
"Title": "Asteroid Collision",
"TitleSlug": "asteroid-collision",
"PassRate": "36%",
"PassRate": "37%",
"Difficulty": "Medium",
"IsAccepted": true,
"IsPaid": false,
Expand Down Expand Up @@ -9037,7 +9037,7 @@
"ID": 751,
"Title": "IP to CIDR",
"TitleSlug": "ip-to-cidr",
"PassRate": "52%",
"PassRate": "53%",
"Difficulty": "Easy",
"IsAccepted": false,
"IsPaid": true,
Expand Down Expand Up @@ -9433,7 +9433,7 @@
"ID": 784,
"Title": "Letter Case Permutation",
"TitleSlug": "letter-case-permutation",
"PassRate": "53%",
"PassRate": "52%",
"Difficulty": "Easy",
"IsAccepted": true,
"IsPaid": false,
Expand Down Expand Up @@ -9865,7 +9865,7 @@
"ID": 820,
"Title": "Short Encoding of Words",
"TitleSlug": "short-encoding-of-words",
"PassRate": "40%",
"PassRate": "41%",
"Difficulty": "Medium",
"IsAccepted": true,
"IsPaid": false,
Expand Down Expand Up @@ -9949,7 +9949,7 @@
"ID": 827,
"Title": "Making A Large Island",
"TitleSlug": "making-a-large-island",
"PassRate": "40%",
"PassRate": "41%",
"Difficulty": "Hard",
"IsAccepted": true,
"IsPaid": false,
Expand Down Expand Up @@ -10033,7 +10033,7 @@
"ID": 834,
"Title": "Sum of Distances in Tree",
"TitleSlug": "sum-of-distances-in-tree",
"PassRate": "30%",
"PassRate": "31%",
"Difficulty": "Hard",
"IsAccepted": true,
"IsPaid": false,
Expand All @@ -10045,7 +10045,7 @@
"ID": 835,
"Title": "Image Overlap",
"TitleSlug": "image-overlap",
"PassRate": "34%",
"PassRate": "35%",
"Difficulty": "Medium",
"IsAccepted": true,
"IsPaid": false,
Expand Down Expand Up @@ -10155,7 +10155,7 @@
"TitleSlug": "backspace-string-compare",
"PassRate": "48%",
"Difficulty": "Easy",
"IsAccepted": false,
"IsAccepted": true,
"IsPaid": false,
"IsFavor": false,
"IsNew": false,
Expand Down

0 comments on commit cf61b35

Please sign in to comment.