Skip to content

Commit f6fb477

Browse files
vv13vv13
committed
feat: 题库更新、脚本修改
1 parent 0bd108b commit f6fb477

File tree

139 files changed

+3115
-1653
lines changed

Some content is hidden

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

139 files changed

+3115
-1653
lines changed

‎README.md

+22-21
Original file line numberDiff line numberDiff line change
@@ -1,67 +1,68 @@
11
## leetcode
22
| 序号 | 名称 | 难度 | 标签 | 链接 | 备注 | 排名 |
33
| :----:| :---- | :----: | :----: | :----: | :---- | :---- |
4-
|1|[two-sum](./leetcode/001.two-sum/)|easy|N Sum|[答案](./leetcode/001.two-sum//solution.py)|||
4+
|1|[two-sum](./leetcode/001.two-sum/)|easy||[答案](./leetcode/001.two-sum//solution.py)|||
55
|2|[add-two-numbers](./leetcode/002.add-two-numbers/)|medium||[答案](./leetcode/002.add-two-numbers//solution.py)|||
66
|3|[longest-substring-without-repeating-characters](./leetcode/003.longest-substring-without-repeating-characters/)|medium||[答案](./leetcode/003.longest-substring-without-repeating-characters//solution.py)|||
77
|4|[median-of-two-sorted-arrays](./leetcode/004.median-of-two-sorted-arrays/)|hard||[答案](./leetcode/004.median-of-two-sorted-arrays//solution.py)|||
88
|5|[longest-palindromic-substring](./leetcode/005.longest-palindromic-substring/)|medium||[答案](./leetcode/005.longest-palindromic-substring//solution.py)|||
99
|6|[zigzag-conversion](./leetcode/006.zigzag-conversion/)|medium||[答案](./leetcode/006.zigzag-conversion//solution.py)|||
10-
|7|[reverse-integer](./leetcode/007.reverse-integer/)|easy||[答案](./leetcode/007.reverse-integer//solution.py)|||
10+
|7|[reverse-integer](./leetcode/007.reverse-integer/)|medium||[答案](./leetcode/007.reverse-integer//solution.py)|||
1111
|8|[string-to-integer-atoi](./leetcode/008.string-to-integer-atoi/)|medium||[答案](./leetcode/008.string-to-integer-atoi//solution.py)|||
1212
|9|[palindrome-number](./leetcode/009.palindrome-number/)|easy||[答案](./leetcode/009.palindrome-number//solution.py)|||
1313
|10|[regular-expression-matching](./leetcode/010.regular-expression-matching/)|hard||[答案](./leetcode/010.regular-expression-matching//solution.py)|||
1414
|11|[container-with-most-water](./leetcode/011.container-with-most-water/)|medium||[答案](./leetcode/011.container-with-most-water//solution.py)|||
1515
|12|[integer-to-roman](./leetcode/012.integer-to-roman/)|medium||[答案](./leetcode/012.integer-to-roman//solution.py)|||
1616
|13|[roman-to-integer](./leetcode/013.roman-to-integer/)|easy||[答案](./leetcode/013.roman-to-integer//solution.py)|||
1717
|14|[longest-common-prefix](./leetcode/014.longest-common-prefix/)|easy||[答案](./leetcode/014.longest-common-prefix//solution.py)|||
18-
|15|[3sum](./leetcode/015.3sum/)|medium|N Sum|[答案](./leetcode/015.3sum//solution.py)|||
19-
|16|[3sum-closest](./leetcode/016.3sum-closest/)|medium|N Sum|[答案](./leetcode/016.3sum-closest//solution.py)|||
18+
|15|[3sum](./leetcode/015.3sum/)|medium||[答案](./leetcode/015.3sum//solution.py)|||
19+
|16|[3sum-closest](./leetcode/016.3sum-closest/)|medium||[答案](./leetcode/016.3sum-closest//solution.py)|||
2020
|17|[letter-combinations-of-a-phone-number](./leetcode/017.letter-combinations-of-a-phone-number/)|medium||[答案](./leetcode/017.letter-combinations-of-a-phone-number//solution.py)|||
21-
|18|[4sum](./leetcode/018.4sum/)|medium|N Sum|[答案](./leetcode/018.4sum//solution.py)|||
21+
|18|[4sum](./leetcode/018.4sum/)|medium||[答案](./leetcode/018.4sum//solution.py)|||
2222
|19|[remove-nth-node-from-end-of-list](./leetcode/019.remove-nth-node-from-end-of-list/)|medium||[答案](./leetcode/019.remove-nth-node-from-end-of-list//solution.py)|||
2323
|20|[valid-parentheses](./leetcode/020.valid-parentheses/)|easy||[答案](./leetcode/020.valid-parentheses//solution.py)|||
2424
|21|[merge-two-sorted-lists](./leetcode/021.merge-two-sorted-lists/)|easy||[答案](./leetcode/021.merge-two-sorted-lists//solution.py)|||
25-
|22|[generate-parentheses](./leetcode/022.generate-parentheses/)|medium|回溯法|[答案](./leetcode/022.generate-parentheses//solution.py)|||
26-
|23|[merge-k-sorted-lists](./leetcode/023.merge-k-sorted-lists/)|hard||[答案](./leetcode/023.merge-k-sorted-lists//solution.py)|待优化||
25+
|22|[generate-parentheses](./leetcode/022.generate-parentheses/)|medium||[答案](./leetcode/022.generate-parentheses//solution.py)|||
26+
|23|[merge-k-sorted-lists](./leetcode/023.merge-k-sorted-lists/)|hard||[答案](./leetcode/023.merge-k-sorted-lists//solution.py)|||
2727
|24|[swap-nodes-in-pairs](./leetcode/024.swap-nodes-in-pairs/)|medium||[答案](./leetcode/024.swap-nodes-in-pairs//solution.py)|||
28-
|25|[reverse-nodes-in-k-group](./leetcode/025.reverse-nodes-in-k-group/)|hard||[答案](./leetcode/025.reverse-nodes-in-k-group//solution.py)|重构列表翻转部分逻辑||
28+
|25|[reverse-nodes-in-k-group](./leetcode/025.reverse-nodes-in-k-group/)|hard||[答案](./leetcode/025.reverse-nodes-in-k-group//solution.py)|||
2929
|26|[remove-duplicates-from-sorted-array](./leetcode/026.remove-duplicates-from-sorted-array/)|easy||[答案](./leetcode/026.remove-duplicates-from-sorted-array//solution.py)|||
3030
|27|[remove-element](./leetcode/027.remove-element/)|easy||[答案](./leetcode/027.remove-element//solution.py)|||
31-
|28|[implement-strstr](./leetcode/028.implement-strstr/)|easy||[答案](./leetcode/028.implement-strstr//solution.py)|||
31+
|28|[find-the-index-of-the-first-occurrence-in-a-string](./leetcode/028.find-the-index-of-the-first-occurrence-in-a-string/)|medium||[答案](./leetcode/028.find-the-index-of-the-first-occurrence-in-a-string//solution.py)|||
3232
|29|[divide-two-integers](./leetcode/029.divide-two-integers/)|medium||[答案](./leetcode/029.divide-two-integers//solution.py)|||
3333
|30|[substring-with-concatenation-of-all-words](./leetcode/030.substring-with-concatenation-of-all-words/)|hard||[答案](./leetcode/030.substring-with-concatenation-of-all-words//solution.py)||73.13%|
3434
|31|[next-permutation](./leetcode/031.next-permutation/)|medium||[答案](./leetcode/031.next-permutation//solution.py)||99.45%|
3535
|32|[longest-valid-parentheses](./leetcode/032.longest-valid-parentheses/)|hard||[答案](./leetcode/032.longest-valid-parentheses//solution.py)||94.82%|
36-
|33|[search-in-rotated-sorted-array](./leetcode/033.search-in-rotated-sorted-array/)|medium|二分法|[答案](./leetcode/033.search-in-rotated-sorted-array//solution.py) [解题思路](./leetcode/033.search-in-rotated-sorted-array//DRAFT.md)||65.84%|
36+
|33|[search-in-rotated-sorted-array](./leetcode/033.search-in-rotated-sorted-array/)|medium|二分法|[答案](./leetcode/033.search-in-rotated-sorted-array//solution.py)||65.84%|
3737
|34|[find-first-and-last-position-of-element-in-sorted-array](./leetcode/034.find-first-and-last-position-of-element-in-sorted-array/)|medium|二分法|[答案](./leetcode/034.find-first-and-last-position-of-element-in-sorted-array//solution.py)||33.12%|
38-
|35|[search-insert-position](./leetcode/035.search-insert-position/)|easy||[答案](./leetcode/035.search-insert-position//solution.py)||73.26%|
38+
|35|[search-insert-position](./leetcode/035.search-insert-position/)|easy|二分查找|[答案](./leetcode/035.search-insert-position//solution.py)||73.26%|
3939
|36|[valid-sudoku](./leetcode/036.valid-sudoku/)|medium||[答案](./leetcode/036.valid-sudoku//solution.py)|||
4040
|37|[sudoku-solver](./leetcode/037.sudoku-solver/)|hard||[答案](./leetcode/037.sudoku-solver//solution.py)|||
4141
|38|[count-and-say](./leetcode/038.count-and-say/)|medium||[答案](./leetcode/038.count-and-say//solution.py)|||
4242
|39|[combination-sum](./leetcode/039.combination-sum/)|medium||[答案](./leetcode/039.combination-sum//solution.py)|||
4343
|46|[permutations](./leetcode/046.permutations/)|medium||[答案](./leetcode/046.permutations//solution.py)|||
4444
|47|[permutations-ii](./leetcode/047.permutations-ii/)|medium||[答案](./leetcode/047.permutations-ii//solution.py)|||
45-
|53|[maximum-subarray](./leetcode/053.maximum-subarray/)|easy||[答案](./leetcode/053.maximum-subarray//solution.py)|||
46-
|69|[sqrtx](./leetcode/069.sqrtx/)|easy|二分法, 巴比伦平方根|[答案](./leetcode/069.sqrtx//solution.py)|||
45+
|53|[maximum-subarray](./leetcode/053.maximum-subarray/)|medium||[答案](./leetcode/053.maximum-subarray//solution.py)|||
46+
|69|[sqrtx](./leetcode/069.sqrtx/)|easy||[答案](./leetcode/069.sqrtx//solution.py)|||
4747
|102|[binary-tree-level-order-traversal](./leetcode/102.binary-tree-level-order-traversal/)|medium||[答案](./leetcode/102.binary-tree-level-order-traversal//solution.py)|||
4848
|136|[single-number](./leetcode/136.single-number/)|easy|异或运算|[答案](./leetcode/136.single-number//solution.py)||95.55%|
4949
|141|[linked-list-cycle](./leetcode/141.linked-list-cycle/)|easy||[答案](./leetcode/141.linked-list-cycle//solution.py)||86%|
5050
|146|[lru-cache](./leetcode/146.lru-cache/)|medium||[答案](./leetcode/146.lru-cache//solution.py)|||
51-
|202|[happy-number](./leetcode/202.happy-number/)|easy||[答案](./leetcode/202.happy-number//solution.py) [解题思路](./leetcode/202.happy-number//DRAFT.md)|||
51+
|202|[happy-number](./leetcode/202.happy-number/)|easy||[答案](./leetcode/202.happy-number//solution.py)|||
5252
|206|[reverse-linked-list](./leetcode/206.reverse-linked-list/)|easy||[答案](./leetcode/206.reverse-linked-list//solution.py)||61.23%|
5353
|300|[longest-increasing-subsequence](./leetcode/300.longest-increasing-subsequence/)|medium||[答案](./leetcode/300.longest-increasing-subsequence//solution.py)||30.35%|
5454
|443|[string-compression](./leetcode/443.string-compression/)|medium||[答案](./leetcode/443.string-compression//solution.py)|||
55-
|454|[4sum-ii](./leetcode/454.4sum-ii/)|medium|N Sum|[答案](./leetcode/454.4sum-ii//solution.py)|||
55+
|454|[4sum-ii](./leetcode/454.4sum-ii/)|medium||[答案](./leetcode/454.4sum-ii//solution.py)|||
56+
|500|[keyboard-row](./leetcode/500.keyboard-row/)|easy||[答案](./leetcode/500.keyboard-row//solution.py)|||
5657
|771|[jewels-and-stones](./leetcode/771.jewels-and-stones/)|easy|N Sum|[答案](./leetcode/771.jewels-and-stones//solution.py)||30.55%|
5758
|807|[max-increase-to-keep-city-skyline](./leetcode/807.max-increase-to-keep-city-skyline/)|medium|N Sum|[答案](./leetcode/807.max-increase-to-keep-city-skyline//solution.py)||97.58%|
5859

5960
## 相关文章
60-
- [二叉查找树](https://vv13.cn/Algorithm/%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91/)
61-
- [冒泡、选择与插入排序](https://vv13.cn/Algorithm/%E5%86%92%E6%B3%A1%E3%80%81%E9%80%89%E6%8B%A9%E4%B8%8E%E6%8F%92%E5%85%A5%E6%8E%92%E5%BA%8F/)
62-
- [求质数的几种方法](https://vv13.cn/Algorithm/%E6%B1%82%E8%B4%A8%E6%95%B0%E7%9A%84%E5%87%A0%E7%A7%8D%E6%96%B9%E6%B3%95/)
63-
- [八皇后问题](https://vv13.cn/Algorithm/%E5%85%AB%E7%9A%87%E5%90%8E%E9%97%AE%E9%A2%98/)
64-
- [汉诺塔问题](https://vv13.cn/Algorithm/%E6%B1%89%E8%AF%BA%E5%A1%94%E9%97%AE%E9%A2%98/)
61+
- [二叉查找树](https://vv13.cn/blog/post/Algorithm/20180904_%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91)
62+
- [冒泡、选择与插入排序](https://vv13.cn/blog/post/Algorithm/20161226_%E5%86%92%E6%B3%A1%E3%80%81%E9%80%89%E6%8B%A9%E4%B8%8E%E6%8F%92%E5%85%A5%E6%8E%92%E5%BA%8F)
63+
- [求质数的几种方法](https://vv13.cn/blog/post/Algorithm/20161226_%E6%B1%82%E8%B4%A8%E6%95%B0%E7%9A%84%E5%87%A0%E7%A7%8D%E6%96%B9%E6%B3%95)
64+
- [八皇后问题](https://vv13.cn/blog/post/Algorithm/20180805_%E5%85%AB%E7%9A%87%E5%90%8E%E9%97%AE%E9%A2%98)
65+
- [汉诺塔问题](https://vv13.cn/blog/post/Algorithm/20180722_%E6%B1%89%E8%AF%BA%E5%A1%94%E9%97%AE%E9%A2%98)
6566

6667
## 其他
67-
若对项目组织结构感兴趣，可以参照[项目结构指导](./structure_guide.md)。
68+
若对项目组织结构感兴趣，可以使用[leetcode-problems-crawler](https://github.com/vv13/leetcode-problems-crawler)进行题目的抓取。

‎README_TEMPLATE.md

+6-6
Original file line numberDiff line numberDiff line change
@@ -4,11 +4,11 @@
44
${leetcode}
55

66
## 相关文章
7-
- [二叉查找树](https://vv13.cn/Algorithm/%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91/)
8-
- [冒泡、选择与插入排序](https://vv13.cn/Algorithm/%E5%86%92%E6%B3%A1%E3%80%81%E9%80%89%E6%8B%A9%E4%B8%8E%E6%8F%92%E5%85%A5%E6%8E%92%E5%BA%8F/)
9-
- [求质数的几种方法](https://vv13.cn/Algorithm/%E6%B1%82%E8%B4%A8%E6%95%B0%E7%9A%84%E5%87%A0%E7%A7%8D%E6%96%B9%E6%B3%95/)
10-
- [八皇后问题](https://vv13.cn/Algorithm/%E5%85%AB%E7%9A%87%E5%90%8E%E9%97%AE%E9%A2%98/)
11-
- [汉诺塔问题](https://vv13.cn/Algorithm/%E6%B1%89%E8%AF%BA%E5%A1%94%E9%97%AE%E9%A2%98/)
7+
- [二叉查找树](https://vv13.cn/blog/post/Algorithm/20180904_%E4%BA%8C%E5%8F%89%E6%90%9C%E7%B4%A2%E6%A0%91)
8+
- [冒泡、选择与插入排序](https://vv13.cn/blog/post/Algorithm/20161226_%E5%86%92%E6%B3%A1%E3%80%81%E9%80%89%E6%8B%A9%E4%B8%8E%E6%8F%92%E5%85%A5%E6%8E%92%E5%BA%8F)
9+
- [求质数的几种方法](https://vv13.cn/blog/post/Algorithm/20161226_%E6%B1%82%E8%B4%A8%E6%95%B0%E7%9A%84%E5%87%A0%E7%A7%8D%E6%96%B9%E6%B3%95)
10+
- [八皇后问题](https://vv13.cn/blog/post/Algorithm/20180805_%E5%85%AB%E7%9A%87%E5%90%8E%E9%97%AE%E9%A2%98)
11+
- [汉诺塔问题](https://vv13.cn/blog/post/Algorithm/20180722_%E6%B1%89%E8%AF%BA%E5%A1%94%E9%97%AE%E9%A2%98)
1212

1313
## 其他
14-
若对项目组织结构感兴趣，可以参照[项目结构指导](./structure_guide.md)。
14+
若对项目组织结构感兴趣，可以使用[leetcode-problems-crawler](https://github.com/vv13/leetcode-problems-crawler)进行题目的抓取。

‎docs/300.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
# 300. Longest Increasing Subsequence（最长递增子序列，JS描述）
2-
> [原题地址](https://leetcode.com/articles/longest-increasing-subsequence/)
2+
> [原题地址](https://leetcode.com/problems/longest-increasing-subsequence/)
33
44
## 题目
55
```

‎leetcode/033.search-in-rotated-sorted-array/DRAFT.md ‎docs/33.md

File renamed without changes.

‎generate_markdown.py

+7-4
Original file line numberDiff line numberDiff line change
@@ -14,18 +14,21 @@ def genLineStr(s: str):
1414
if os.path.exists(source_dir + 'information.json'):
1515
information_file = open(source_dir + '/information.json', 'r')
1616
information_data = json.load(information_file)
17+
info['difficulty'] = information_data.get('difficulty', '')
18+
information_file.close()
19+
20+
if os.path.exists(source_dir + 'data.json'):
21+
data_file = open(source_dir + '/data.json', 'r')
22+
information_data = json.load(data_file)
1723
info['tags'] = ', '.join(information_data.get('tags', []))
1824
info['mark'] = information_data.get('mark', '')
19-
info['difficulty'] = information_data.get('difficulty', '')
2025
rank = information_data.get('rank', '')
2126
info['rank'] = str(rank) + '%' if rank else ''
22-
information_file.close()
27+
data_file.close()
2328

2429
links = [
2530
'[答案]({0})'.format(os.path.join(source_dir + '/solution.py'))
2631
]
27-
if os.path.exists(source_dir + 'DRAFT.md'):
28-
links.append('[解题思路]({0})'.format(source_dir + '/DRAFT.md'))
2932
info['links'] = ' '.join(links)
3033

3134
return '|{number}|{link_name}|{difficulty}|{tags}|{links}|{mark}|{rank}|'.format(**info)

‎leetcode/001.two-sum/README.md

+46-14
Original file line numberDiff line numberDiff line change
@@ -1,19 +1,51 @@
1-
## [1. Two Sum](https://leetcode.com/problems/two-sum/)
2-
<p>Given an array of integers, return <strong>indices</strong> of the two numbers such that they add up to a specific target.</p>
3-
4-
<p>You may assume that each input would have <strong><em>exactly</em></strong> one solution, and you may not use the <em>same</em> element twice.</p>
5-
6-
<p><strong>Example:</strong></p>
7-
8-
<pre>
9-
Given nums = [2, 7, 11, 15], target = 9,
10-
11-
Because nums[<strong>0</strong>] + nums[<strong>1</strong>] = 2 + 7 = 9,
12-
return [<strong>0</strong>, <strong>1</strong>].
13-
</pre>
1+
## [1. 两数之和](https://leetcode-cn.com/problems/two-sum/)
2+
<p>给定一个整数数组 <code>nums</code>&nbsp;和一个整数目标值 <code>target</code>，请你在该数组中找出 <strong>和为目标值 </strong><em><code>target</code></em>&nbsp; 的那&nbsp;<strong>两个</strong>&nbsp;整数，并返回它们的数组下标。</p>
3+
4+
<p>你可以假设每种输入只会对应一个答案。但是，数组中同一个元素在答案里不能重复出现。</p>
5+
6+
<p>你可以按任意顺序返回答案。</p>
7+
8+
<p>&nbsp;</p>
9+
10+
<p><strong class="example">示例 1：</strong></p>
11+
12+
<pre>
13+
<strong>输入：</strong>nums = [2,7,11,15], target = 9
14+
<strong>输出：</strong>[0,1]
15+
<strong>解释：</strong>因为 nums[0] + nums[1] == 9 ，返回 [0, 1] 。
16+
</pre>
17+
18+
<p><strong class="example">示例 2：</strong></p>
19+
20+
<pre>
21+
<strong>输入：</strong>nums = [3,2,4], target = 6
22+
<strong>输出：</strong>[1,2]
23+
</pre>
24+
25+
<p><strong class="example">示例 3：</strong></p>
26+
27+
<pre>
28+
<strong>输入：</strong>nums = [3,3], target = 6
29+
<strong>输出：</strong>[0,1]
30+
</pre>
31+
32+
<p>&nbsp;</p>
33+
34+
<p><strong>提示：</strong></p>
35+
36+
<ul>
37+
<li><code>2 &lt;= nums.length &lt;= 10<sup>4</sup></code></li>
38+
<li><code>-10<sup>9</sup> &lt;= nums[i] &lt;= 10<sup>9</sup></code></li>
39+
<li><code>-10<sup>9</sup> &lt;= target &lt;= 10<sup>9</sup></code></li>
40+
<li><strong>只会存在一个有效答案</strong></li>
41+
</ul>
42+
43+
<p>&nbsp;</p>
44+
45+
<p><strong>进阶：</strong>你可以想出一个时间复杂度小于 <code>O(n<sup>2</sup>)</code> 的算法吗？</p>
1446

1547

1648
## Hints
1749
1. A really brute force way would be to search for all possible pairs of numbers but that would be too slow. Again, it's best to try out brute force solutions for just for completeness. It is from these brute force solutions that you can come up with optimizations.
18-
2. So, if we fix one of the numbers, say <pre>x</pre>, we have to scan the entire array to find the next number <pre>y</pre> which is <pre>value - x</pre> where value is the input parameter. Can we change our array somehow so that this search becomes faster?
50+
2. So, if we fix one of the numbers, say <code>x</code>, we have to scan the entire array to find the next number <code>y</code> which is <code>value - x</code> where value is the input parameter. Can we change our array somehow so that this search becomes faster?
1951
3. The second train of thought is, without changing the array, can we use additional space somehow? Like maybe a hash map to speed up the search?

‎leetcode/001.two-sum/information.json

+44-4
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,47 @@
11
{
2-
"tags": [
3-
"N Sum"
4-
],
52
"difficulty": "easy",
6-
"similarQuestions": "[{\"title\": \"3Sum\", \"titleSlug\": \"3sum\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"4Sum\", \"titleSlug\": \"4sum\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Two Sum II - Input array is sorted\", \"titleSlug\": \"two-sum-ii-input-array-is-sorted\", \"difficulty\": \"Easy\", \"translatedTitle\": null}, {\"title\": \"Two Sum III - Data structure design\", \"titleSlug\": \"two-sum-iii-data-structure-design\", \"difficulty\": \"Easy\", \"translatedTitle\": null}, {\"title\": \"Subarray Sum Equals K\", \"titleSlug\": \"subarray-sum-equals-k\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Two Sum IV - Input is a BST\", \"titleSlug\": \"two-sum-iv-input-is-a-bst\", \"difficulty\": \"Easy\", \"translatedTitle\": null}, {\"title\": \"Two Sum Less Than K\", \"titleSlug\": \"two-sum-less-than-k\", \"difficulty\": \"Easy\", \"translatedTitle\": null}]"
3+
"similarQuestions": [
4+
{
5+
"title": "3Sum",
6+
"titleSlug": "3sum",
7+
"difficulty": "Medium",
8+
"translatedTitle": "三数之和"
9+
},
10+
{
11+
"title": "4Sum",
12+
"titleSlug": "4sum",
13+
"difficulty": "Medium",
14+
"translatedTitle": "四数之和"
15+
},
16+
{
17+
"title": "Two Sum II - Input Array Is Sorted",
18+
"titleSlug": "two-sum-ii-input-array-is-sorted",
19+
"difficulty": "Medium",
20+
"translatedTitle": "两数之和 II - 输入有序数组"
21+
},
22+
{
23+
"title": "Two Sum III - Data structure design",
24+
"titleSlug": "two-sum-iii-data-structure-design",
25+
"difficulty": "Easy",
26+
"translatedTitle": "两数之和 III - 数据结构设计"
27+
},
28+
{
29+
"title": "Subarray Sum Equals K",
30+
"titleSlug": "subarray-sum-equals-k",
31+
"difficulty": "Medium",
32+
"translatedTitle": "和为 K 的子数组"
33+
},
34+
{
35+
"title": "Two Sum IV - Input is a BST",
36+
"titleSlug": "two-sum-iv-input-is-a-bst",
37+
"difficulty": "Easy",
38+
"translatedTitle": "两数之和 IV - 输入二叉搜索树"
39+
},
40+
{
41+
"title": "Two Sum Less Than K",
42+
"titleSlug": "two-sum-less-than-k",
43+
"difficulty": "Easy",
44+
"translatedTitle": "小于 K 的两数之和"
45+
}
46+
]
747
}

0 commit comments

Comments
 (0)