ziyang_li/LeetCode
1
0
Fork 0
mirror of https://github.com/ShusenTang/LeetCode.git synced 2024-09-02 14:20:01 +00:00
Code Issues Packages Projects Releases Wiki Activity

add 373

Browse Source
This commit is contained in:
ShusenTang 2019-12-16 16:37:00 +08:00 committed by GitHub
parent bee4baafb4
commit 4ae6defaa0
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 1 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

1
README.md
View File

@ -224,6 +224,7 @@ My LeetCode solutions with Chinese explanation. 我的LeetCode中文题解。
| 368 |[Largest Divisible Subset](https://leetcode.com/problems/largest-divisible-subset/)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/368.%20Largest%20Divisible%20Subset.md)|Medium| |
| 371 |[Sum of Two Integers](https://leetcode.com/problems/sum-of-two-integers)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/371.%20Sum%20of%20Two%20Integers.md)|Easy| |
| 372 |[Super Pow](https://leetcode.com/problems/super-pow/)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/372.%20Super%20Pow.md)|Medium| |
| 373 |[Find K Pairs with Smallest Sums](https://leetcode.com/problems/find-k-pairs-with-smallest-sums/)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/373.%20Find%20K%20Pairs%20with%20Smallest%20Sums.md)|Medium| |
| 374 |[Guess Number Higher or Lower](https://leetcode.com/problems/guess-number-higher-or-lower)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/374.%20Guess%20Number%20Higher%20or%20Lower.md)|Easy| |
| 383 |[Ransom Note](https://leetcode.com/problems/ransom-note)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/383.%20Ransom%20Note.md)|Easy| |
| 387 |[First Unique Character in a String](https://leetcode.com/problems/first-unique-character-in-a-string)|[C++](https://github.com/ShusenTang/LeetCode/blob/master/solutions/387.%20First%20Unique%20Character%20in%20a%20String.md)|Easy| |