@@ -240,7 +240,7 @@ The `☢` means that you need to have a LeetCode Premium Subscription.
240
240
| 63 | [ Unique Paths II] | [ C] ( src/63.c ) |
241
241
| 62 | [ Unique Paths] | [ C] ( src/62.c ) |
242
242
| 61 | [ Rotate List] | [ C] ( src/61.c ) |
243
- | 60 | [ Permutation Sequence] | [ C] ( src/60.cpp ) |
243
+ | 60 | [ Permutation Sequence] | [ C++ ] ( src/60.cpp ) |
244
244
| 59 | [ Spiral Matrix II] | [ C] ( src/59.c ) |
245
245
| 58 | [ Length of Last Word] | [ C] ( src/58.c ) |
246
246
| 57 | [ Insert Interval] | |
@@ -278,14 +278,14 @@ The `☢` means that you need to have a LeetCode Premium Subscription.
278
278
| 25 | [ Reverse Nodes in k-Group] | |
279
279
| 24 | [ Swap Nodes in Pairs] | [ C] ( src/24.c ) |
280
280
| 23 | [ Merge k Sorted Lists] | [ C] ( src/23.c ) |
281
- | 22 | [ Generate Parentheses] | [ C++] ( src/21 .cpp ) |
281
+ | 22 | [ Generate Parentheses] | [ C++] ( src/222 .cpp ) |
282
282
| 21 | [ Merge Two Sorted Lists] | [ C] ( src/21.c ) |
283
283
| 20 | [ Valid Parentheses] | [ C] ( src/20.c ) |
284
284
| 19 | [ Remove Nth Node From End of List] | [ C] ( src/19.c ) |
285
285
| 18 | [ 4Sum] | |
286
286
| 17 | [ Letter Combinations of a Phone Number] | [ C++] ( src/17.cpp ) |
287
287
| 16 | [ 3Sum Closest] | |
288
- | 15 | [ 3Sum] | [ C++] ( src/15/ cpp ) |
288
+ | 15 | [ 3Sum] | [ C++] ( src/15. cpp ) |
289
289
| 14 | [ Longest Common Prefix] | [ C] ( src/14.c ) |
290
290
| 13 | [ Roman to Integer] | [ C] ( src/13.c ) |
291
291
| 12 | [ Integer to Roman] | [ C] ( src/12.c ) |
@@ -514,7 +514,7 @@ The `☢` means that you need to have a LeetCode Premium Subscription.
514
514
[ Sqrt(x) ] : https://leetcode.com/problems/sqrtx/
515
515
[ Text Justification ] : https://leetcode.com/problems/text-justification/
516
516
[ Add Binary ] : https://leetcode.com/problems/add-binary/
517
- [ Plus One ] : https://leetcode.com/problems/add-binary /
517
+ [ Plus One ] : https://leetcode.com/problems/plus-one /
518
518
[ Valid Number ] : https://leetcode.com/problems/valid-number/
519
519
[ Minimum Path Sum ] : https://leetcode.com/problems/minimum-path-sum/
520
520
[ Unique Paths II ] : https://leetcode.com/problems/unique-paths-ii/
0 commit comments