You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: README.md
+1-1Lines changed: 1 addition & 1 deletion
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -57,7 +57,7 @@ LeetCode Problems' Solutions
57
57
| <spanid="1015">1015</span> |[Numbers With Repeated Digits](https://leetcode.com/problems/numbers-with-repeated-digits"至少有 1 位重复的数字")|[Go](https://github.com/openset/leetcode/tree/master/problems/numbers-with-repeated-digits)| Hard |
58
58
| <spanid="1014">1014</span> |[Capacity To Ship Packages Within D Days](https://leetcode.com/problems/capacity-to-ship-packages-within-d-days"在 D 天内送达包裹的能力")|[Go](https://github.com/openset/leetcode/tree/master/problems/capacity-to-ship-packages-within-d-days)| Medium |
59
59
| <spanid="1013">1013</span> |[Pairs of Songs With Total Durations Divisible by 60](https://leetcode.com/problems/pairs-of-songs-with-total-durations-divisible-by-60"总持续时间可被 60 整除的歌曲")|[Go](https://github.com/openset/leetcode/tree/master/problems/pairs-of-songs-with-total-durations-divisible-by-60)| Easy |
60
-
| <spanid="1012">1012</span> |[Complement of Base 10 Integer](https://leetcode.com/problems/complement-of-base-10-integer"十进制整数的补码")|[Go](https://github.com/openset/leetcode/tree/master/problems/complement-of-base-10-integer)| Easy |
60
+
| <spanid="1012">1012</span> |[Complement of Base 10 Integer](https://leetcode.com/problems/complement-of-base-10-integer"十进制整数的反码")|[Go](https://github.com/openset/leetcode/tree/master/problems/complement-of-base-10-integer)| Easy |
61
61
| <spanid="1008">1008</span> |[Construct Binary Search Tree from Preorder Traversal](https://leetcode.com/problems/construct-binary-search-tree-from-preorder-traversal"先序遍历构造二叉树")|[Go](https://github.com/openset/leetcode/tree/master/problems/construct-binary-search-tree-from-preorder-traversal)| Medium |
62
62
| <spanid="1007">1007</span> |[Minimum Domino Rotations For Equal Row](https://leetcode.com/problems/minimum-domino-rotations-for-equal-row"行相等的最少多米诺旋转")|[Go](https://github.com/openset/leetcode/tree/master/problems/minimum-domino-rotations-for-equal-row)| Medium |
63
63
| <spanid="1006">1006</span> |[Clumsy Factorial](https://leetcode.com/problems/clumsy-factorial"笨阶乘")|[Go](https://github.com/openset/leetcode/tree/master/problems/clumsy-factorial)| Medium |
0 commit comments