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

Commit 5cf8d04

Browse files
aQuaaQua
authored andcommitted
更新 README.md
1 parent 7a8fc42 commit 5cf8d04

File tree

2 files changed

+10
-10
lines changed

2 files changed

+10
-10
lines changed

README.md

Lines changed: 9 additions & 9 deletions
Original file line numberDiff line numberDiff line change
@@ -12,7 +12,7 @@
1212
1313
| |Easy|Medium|Hard|Total|
1414
|:---:|:---:|:---:|:---:|:---:|
15-
|**Accepted**|129|216|96|441|
15+
|**Accepted**|129|218|96|443|
1616
|**Total**|154|257|105|516|
1717

1818
## 题解
@@ -186,7 +186,7 @@
186186
|200|[Number of Islands](./Algorithms/0200.number-of-islands)|35%|Medium| |
187187
|201|[Bitwise AND of Numbers Range](./Algorithms/0201.bitwise-and-of-numbers-range)|34%|Medium|[](https://leetcode.com/list/oussv5j)|
188188
|202|[Happy Number](./Algorithms/0202.happy-number)|41%|Easy| |
189-
|203|[Remove Linked List Elements](./Algorithms/0203.remove-linked-list-elements)|32%|Easy| |
189+
|203|[Remove Linked List Elements](./Algorithms/0203.remove-linked-list-elements)|33%|Easy| |
190190
|204|[Count Primes](./Algorithms/0204.count-primes)|26%|Easy|[](https://leetcode.com/list/oussv5j)|
191191
|205|[Isomorphic Strings](./Algorithms/0205.isomorphic-strings)|34%|Easy|[](https://leetcode.com/list/oussv5j)|
192192
|206|[Reverse Linked List](./Algorithms/0206.reverse-linked-list)|46%|Easy| |
@@ -405,7 +405,7 @@
405405
|529|[Minesweeper](./Algorithms/0529.minesweeper)|49%|Medium| |
406406
|530|[Minimum Absolute Difference in BST](./Algorithms/0530.minimum-absolute-difference-in-bst)|47%|Easy|[](https://leetcode.com/list/oussv5j)|
407407
|532|[K-diff Pairs in an Array](./Algorithms/0532.k-diff-pairs-in-an-array)|28%|Easy| |
408-
|537|[Complex Number Multiplication](./Algorithms/0537.complex-number-multiplication)|64%|Medium| |
408+
|537|[Complex Number Multiplication](./Algorithms/0537.complex-number-multiplication)|63%|Medium| |
409409
|538|[Convert BST to Greater Tree](./Algorithms/0538.convert-bst-to-greater-tree)|49%|Easy| |
410410
|539|[Minimum Time Difference](./Algorithms/0539.minimum-time-difference)|46%|Medium| |
411411
|540|[Single Element in a Sorted Array](./Algorithms/0540.single-element-in-a-sorted-array)|56%|Medium| |
@@ -461,8 +461,8 @@
461461
|645| * Set Mismatch|39%|Easy| |
462462
|646|[Maximum Length of Pair Chain](./Algorithms/0646.maximum-length-of-pair-chain)|47%|Medium| |
463463
|647| * Palindromic Substrings|55%|Medium| |
464-
|648| * Replace Words|47%|Medium| |
465-
|649| * Dota2 Senate|35%|Medium| |
464+
|648|[Replace Words](./Algorithms/0648.replace-words)|47%|Medium| |
465+
|649|[Dota2 Senate](./Algorithms/0649.dota2-senate)|35%|Medium|[](https://leetcode.com/list/oussv5j)|
466466
|650| * 2 Keys Keyboard|44%|Medium| |
467467
|652| * Find Duplicate Subtrees|36%|Medium| |
468468
|653| * Two Sum IV - Input is a BST|50%|Easy| |
@@ -505,11 +505,11 @@
505505
|698| * Partition to K Equal Sum Subsets|37%|Medium| |
506506
|699|[Falling Squares](./Algorithms/0699.falling-squares)|37%|Hard| |
507507
|712| * Minimum ASCII Delete Sum for Two Strings|50%|Medium| |
508-
|713| * Subarray Product Less Than K|33%|Medium| |
508+
|713| * Subarray Product Less Than K|32%|Medium| |
509509
|714| * Best Time to Buy and Sell Stock with Transaction Fee|41%|Medium| |
510510
|715| * Range Module|30%|Hard| |
511511
|717| * 1-bit and 2-bit Characters|50%|Easy| |
512-
|718| * Maximum Length of Repeated Subarray|39%|Medium| |
512+
|718| * Maximum Length of Repeated Subarray|40%|Medium| |
513513
|719| * Find K-th Smallest Pair Distance|26%|Hard| |
514514
|720| * Longest Word in Dictionary|40%|Easy| |
515515
|721| * Accounts Merge|29%|Medium| |
@@ -531,9 +531,9 @@
531531
|739| * Daily Temperatures|53%|Medium| |
532532
|740| * Delete and Earn|41%|Medium| |
533533
|741| * Cherry Pickup|22%|Hard| |
534-
|743| * Closest Leaf in a Binary Tree|30%|Medium| |
534+
|743| * Closest Leaf in a Binary Tree|31%|Medium| |
535535
|744| * Network Delay Time|32%|Medium| |
536-
|745| * Find Smallest Letter Greater Than Target|52%|Easy| |
536+
|745| * Find Smallest Letter Greater Than Target|51%|Easy| |
537537
|746| * Prefix and Suffix Search|20%|Hard| |
538538

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

leetcode.json

Lines changed: 1 addition & 1 deletion
Large diffs are not rendered by default.

0 commit comments

Comments
 (0)