Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly
Appearance settings

Commit 245a172

Browse filesBrowse files
2xiao2xiao
committed
add 25 solutions
1 parent 5f8b364 commit 245a172
Copy full SHA for 245a172

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.
Dismiss banner

56 files changed

+4050
-100
lines changed

‎src/.vuepress/sidebar.ts

Copy file name to clipboardExpand all lines: src/.vuepress/sidebar.ts
+26-1Lines changed: 26 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -785,18 +785,43 @@ export default sidebar({
785785
"1813",
786786
"1816",
787787
"1822",
788+
"1827",
788789
"1829",
790+
"1832",
791+
"1837",
792+
"1844",
793+
"1848",
794+
"1854",
795+
"1859",
789796
"1861",
790-
"1873"
797+
"1863",
798+
"1869",
799+
"1873",
800+
"1876",
801+
"1880",
802+
"1886",
803+
"1893",
804+
"1897"
791805
]
792806
},
793807
{
794808
"text": "1900-1999",
795809
"collapsible": true,
796810
"children": [
811+
"1903",
812+
"1909",
813+
"1913",
814+
"1920",
815+
"1925",
797816
"1926",
817+
"1929",
818+
"1935",
819+
"1941",
798820
"1942",
821+
"1945",
822+
"1952",
799823
"1957",
824+
"1961",
800825
"1963",
801826
"1975"
802827
]

‎src/book/enumeration.md

Copy file name to clipboardExpand all lines: src/book/enumeration.md
+1-1Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -12,7 +12,7 @@
1212
| :------: | :------ | :------: | :------ | :------: | :------: |
1313
| 1 | 两数之和 | [[✓]](/problem/0001.md) | [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) | 🟢 | [🀄️](https://leetcode.cn/problems/two-sum) [🔗](https://leetcode.com/problems/two-sum) |
1414
| 204 | 计数质数 | | [`数组`](/tag/array.md) [`数学`](/tag/math.md) [`枚举`](/tag/enumeration.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/count-primes) [🔗](https://leetcode.com/problems/count-primes) |
15-
| 1925 | 统计平方和三元组的数目 | | [`数学`](/tag/math.md) [`枚举`](/tag/enumeration.md) | 🟢 | [🀄️](https://leetcode.cn/problems/count-square-sum-triples) [🔗](https://leetcode.com/problems/count-square-sum-triples) |
15+
| 1925 | 统计平方和三元组的数目 | [[✓]](/problem/1925.md) | [`数学`](/tag/math.md) [`枚举`](/tag/enumeration.md) | 🟢 | [🀄️](https://leetcode.cn/problems/count-square-sum-triples) [🔗](https://leetcode.com/problems/count-square-sum-triples) |
1616
| 1450 | 在既定时间做作业的学生人数 | [[✓]](/problem/1450.md) | [`数组`](/tag/array.md) | 🟢 | [🀄️](https://leetcode.cn/problems/number-of-students-doing-homework-at-a-given-time) [🔗](https://leetcode.com/problems/number-of-students-doing-homework-at-a-given-time) |
1717
| 1620 | 网络信号最好的坐标 | | [`数组`](/tag/array.md) [`枚举`](/tag/enumeration.md) | 🟠 | [🀄️](https://leetcode.cn/problems/coordinate-with-maximum-network-quality) [🔗](https://leetcode.com/problems/coordinate-with-maximum-network-quality) |
1818
| 剑指 Offer 57-II | 和为s的连续正数序列 | [[✓]](/offer/jz_offer_57_2.md) | [`数学`](/tag/math.md) [`双指针`](/tag/two-pointers.md) [`枚举`](/tag/enumeration.md) | 🟢 | [🀄️](https://leetcode.cn/problems/he-wei-sde-lian-xu-zheng-shu-xu-lie-lcof) |

‎src/book/hash.md

Copy file name to clipboardExpand all lines: src/book/hash.md
+1-1Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -658,7 +658,7 @@ jsonToMap('[[true,7],[{"foo":3},["abc"]]]');
658658
| 217 | 存在重复元素 | [[✓]](/problem/0217.md) | [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`排序`](/tag/sorting.md) | 🟢 | [🀄️](https://leetcode.cn/problems/contains-duplicate) [🔗](https://leetcode.com/problems/contains-duplicate) |
659659
| 219 | 存在重复元素 II | [[✓]](/problem/0219.md) | [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`滑动窗口`](/tag/sliding-window.md) | 🟢 | [🀄️](https://leetcode.cn/problems/contains-duplicate-ii) [🔗](https://leetcode.com/problems/contains-duplicate-ii) |
660660
| 220 | 存在重复元素 III | | [`数组`](/tag/array.md) [`桶排序`](/tag/bucket-sort.md) [`有序集合`](/tag/ordered-set.md) `2+` | 🔴 | [🀄️](https://leetcode.cn/problems/contains-duplicate-iii) [🔗](https://leetcode.com/problems/contains-duplicate-iii) |
661-
| 1941 | 检查是否所有字符出现次数相同 | | [`哈希表`](/tag/hash-table.md) [`字符串`](/tag/string.md) [`计数`](/tag/counting.md) | 🟢 | [🀄️](https://leetcode.cn/problems/check-if-all-characters-have-equal-number-of-occurrences) [🔗](https://leetcode.com/problems/check-if-all-characters-have-equal-number-of-occurrences) |
661+
| 1941 | 检查是否所有字符出现次数相同 | [[✓]](/problem/1941.md) | [`哈希表`](/tag/hash-table.md) [`字符串`](/tag/string.md) [`计数`](/tag/counting.md) | 🟢 | [🀄️](https://leetcode.cn/problems/check-if-all-characters-have-equal-number-of-occurrences) [🔗](https://leetcode.com/problems/check-if-all-characters-have-equal-number-of-occurrences) |
662662
| 136 | 只出现一次的数字 | [[✓]](/problem/0136.md) | [`位运算`](/tag/bit-manipulation.md) [`数组`](/tag/array.md) | 🟢 | [🀄️](https://leetcode.cn/problems/single-number) [🔗](https://leetcode.com/problems/single-number) |
663663
| 383 | 赎金信 | [[✓]](/problem/0383.md) | [`哈希表`](/tag/hash-table.md) [`字符串`](/tag/string.md) [`计数`](/tag/counting.md) | 🟢 | [🀄️](https://leetcode.cn/problems/ransom-note) [🔗](https://leetcode.com/problems/ransom-note) |
664664
| 349 | 两个数组的交集 | [[✓]](/problem/0349.md) | [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`双指针`](/tag/two-pointers.md) `2+` | 🟢 | [🀄️](https://leetcode.cn/problems/intersection-of-two-arrays) [🔗](https://leetcode.com/problems/intersection-of-two-arrays) |

‎src/book/tree.md

Copy file name to clipboardExpand all lines: src/book/tree.md
+1-1Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1158,7 +1158,7 @@ class NumArray {
11581158
| 354 | 俄罗斯套娃信封问题 | [[✓]](/problem/0354.md) | [`数组`](/tag/array.md) [`二分查找`](/tag/binary-search.md) [`动态规划`](/tag/dynamic-programming.md) `1+` | 🔴 | [🀄️](https://leetcode.cn/problems/russian-doll-envelopes) [🔗](https://leetcode.com/problems/russian-doll-envelopes) |
11591159
| 673 | 最长递增子序列的个数 | | [`树状数组`](/tag/binary-indexed-tree.md) [`线段树`](/tag/segment-tree.md) [`数组`](/tag/array.md) `1+` | 🟠 | [🀄️](https://leetcode.cn/problems/number-of-longest-increasing-subsequence) [🔗](https://leetcode.com/problems/number-of-longest-increasing-subsequence) |
11601160
| 1310 | 子数组异或查询 | | [`位运算`](/tag/bit-manipulation.md) [`数组`](/tag/array.md) [`前缀和`](/tag/prefix-sum.md) | 🟠 | [🀄️](https://leetcode.cn/problems/xor-queries-of-a-subarray) [🔗](https://leetcode.com/problems/xor-queries-of-a-subarray) |
1161-
| 1893 | 检查是否区域内所有整数都被覆盖 | | [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`前缀和`](/tag/prefix-sum.md) | 🟢 | [🀄️](https://leetcode.cn/problems/check-if-all-the-integers-in-a-range-are-covered) [🔗](https://leetcode.com/problems/check-if-all-the-integers-in-a-range-are-covered) |
1161+
| 1893 | 检查是否区域内所有整数都被覆盖 | [[✓]](/problem/1893.md) | [`数组`](/tag/array.md) [`哈希表`](/tag/hash-table.md) [`前缀和`](/tag/prefix-sum.md) | 🟢 | [🀄️](https://leetcode.cn/problems/check-if-all-the-integers-in-a-range-are-covered) [🔗](https://leetcode.com/problems/check-if-all-the-integers-in-a-range-are-covered) |
11621162

11631163
#### 并查集
11641164

0 commit comments

Comments
0 (0)
Morty Proxy This is a proxified and sanitized view of the page, visit original site.