learning
/
leetcode
mirror of https://github.com/doocs/leetcode.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

style: update description to lc problem: No.34

This commit is contained in:
thinkasany 2023-04-07 00:07:32 +08:00
parent c07311d69d
commit 2da4a4ab33
2 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
solution/0000-0099/0034.Find First and Last Position of Element in Sorted Array/README.md
View File

@ -17,13 +17,13 @@
<p><strong>示例 1：</strong></p>
<pre>
<strong>输入：</strong>nums = [<code>5,7,7,8,8,10]</code>, target = 8
<strong>输入：</strong>nums = [5,7,7,8,8,10], target = 8
<strong>输出：</strong>[3,4]</pre>
<p><strong>示例&nbsp;2：</strong></p>
<pre>
<strong>输入：</strong>nums = [<code>5,7,7,8,8,10]</code>, target = 6
<strong>输入：</strong>nums = [5,7,7,8,8,10], target = 6
<strong>输出：</strong>[-1,-1]</pre>
<p><strong>示例 3：</strong></p>

2
solution/main.py
View File

@ -134,7 +134,7 @@ def generate_summary(result):
def refresh(result):
"""update problems"""
pattern = re.compile("src=\"(.*?)\"")
skip_question_ids = {3, 33, 1599}
skip_question_ids = {3, 33, 34, 1599}
for question in result:
front_question_id = question['frontend_question_id']