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
Sign up
Appearance settings

Commit acaedfe

Browse files
feat: update lc problems (doocs#2673)
1 parent a0aa109 commit acaedfe

File tree

19 files changed

+60
-68
lines changed

19 files changed

+60
-68
lines changed

‎solution/0000-0099/0005.Longest Palindromic Substring/README.md‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@
22

33
[English Version](/solution/0000-0099/0005.Longest%20Palindromic%20Substring/README_EN.md)
44

5-
<!-- tags:字符串,动态规划 -->
5+
<!-- tags:双指针,字符串,动态规划 -->
66

77
## 题目描述
88

‎solution/0000-0099/0005.Longest Palindromic Substring/README_EN.md‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@
22

33
[中文文档](/solution/0000-0099/0005.Longest%20Palindromic%20Substring/README.md)
44

5-
<!-- tags:String,Dynamic Programming -->
5+
<!-- tags:Two Pointers,String,Dynamic Programming -->
66

77
## Description
88

‎solution/0200-0299/0281.Zigzag Iterator/README.md‎

Lines changed: 32 additions & 16 deletions
Original file line numberDiff line numberDiff line change
@@ -8,30 +8,46 @@
88

99
<!-- 这里写题目描述 -->
1010

11-
<p>给出两个一维的向量,请你实现一个迭代器,交替返回它们中间的元素。</p>
11+
<p>给出两个整数向量&nbsp;<code>v1</code>&nbsp;和&nbsp;<code>v2</code>,请你实现一个迭代器,交替返回它们中间的元素。</p>
1212

13-
<p><strong>示例:</strong></p>
13+
<p>实现&nbsp;<code>ZigzagIterator</code>&nbsp;类:</p>
1414

15-
<pre><strong>输入:</strong>
16-
v1 = [1,2]
17-
v2 = [3,4,5,6]
15+
<ul>
16+
<li><code>ZigzagIterator(List&lt;int&gt; v1, List&lt;int&gt; v2)</code>&nbsp;用两个向量&nbsp;<code>v1</code>&nbsp;和&nbsp;<code>v2</code>&nbsp;初始化对象。</li>
17+
<li><code>boolean hasNext()</code>&nbsp;如果迭代器还有元素返回&nbsp;<code>true</code>,否则返回 <code>false</code>。</li>
18+
<li><code>int next()</code>&nbsp;返回迭代器的当前元素并将迭代器移动到下一个元素。</li>
19+
</ul>
1820

19-
<strong>输出:</strong> <code>[1,3,2,4,5,6]
21+
<p><strongclass="example">示例 1:</strong></p>
2022

21-
<strong>解析:</strong></code>&nbsp;通过连续调用 <em>next</em> 函数直到 <em>hasNext</em> 函数返回 <code>false,</code>
22-
&nbsp; <em>next</em> 函数返回值的次序应依次为: <code>[1,3,2,4,5,6]。</code></pre>
23+
<pre>
24+
<strong>输入:</strong>v1 = [1,2], v2 = [3,4,5,6]
25+
<strong>输出:</strong>[1,3,2,4,5,6]
26+
<strong>解释:</strong>通过重复调用 next 直到 hasNext 返回 false,那么 next 返回的元素的顺序应该是:[1,3,2,4,5,6]。
27+
</pre>
28+
29+
<p><strong class="example">示例 2:</strong></p>
30+
31+
<pre>
32+
<strong>输入:</strong>v1 = [1], v2 = []
33+
<strong>输出:</strong>[1]
34+
</pre>
35+
36+
<p><strong class="example">示例 3:</strong></p>
2337

24-
<p><strong>拓展:</strong>假如给你&nbsp;<code>k</code>&nbsp;个一维向量呢?你的代码在这种情况下的扩展性又会如何呢?</p>
38+
<pre>
39+
<strong>输入:</strong>v1 = [], v2 = [1]
40+
<strong>输出:</strong>[1]
41+
</pre>
2542

26-
<p><strong>拓展声明:</strong><br>
27-
&nbsp;&ldquo;锯齿&rdquo; 顺序对于&nbsp;<code>k &gt; 2</code>&nbsp;的情况定义可能会有些歧义。所以,假如你觉得 &ldquo;锯齿&rdquo; 这个表述不妥,也可以认为这是一种&nbsp;&ldquo;循环&rdquo;。例如:</p>
43+
<p><strong>拓展:</strong>假如给你&nbsp;<code>k</code>&nbsp;个向量呢?你的代码在这种情况下的扩展性又会如何呢?</p>
2844

29-
<pre><strong>输入:</strong>
30-
[1,2,3]
31-
[4,5,6,7]
32-
[8,9]
45+
<p><strong>拓展声明:</strong><br />
46+
&nbsp;"锯齿" 顺序对于&nbsp;<code>k &gt; 2</code>&nbsp;的情况定义可能会有些歧义。所以,假如你觉得 "锯齿" 这个表述不妥,也可以认为这是一种&nbsp;"循环"。例如:</p>
3347

34-
<strong>输出: </strong><code>[1,4,8,2,5,9,3,6,7]</code>.
48+
<pre>
49+
<strong>输入:</strong>v1 = [1,2,3], v2 = [4,5,6,7], v3 = [8,9]
50+
<strong>输出:</strong>[1,4,8,2,5,9,3,6,7]
3551
</pre>
3652

3753
## 解法

‎solution/0600-0699/0642.Design Search Autocomplete System/README.md‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@
22

33
[English Version](/solution/0600-0699/0642.Design%20Search%20Autocomplete%20System/README_EN.md)
44

5-
<!-- tags:设计,字典树,字符串,数据流 -->
5+
<!-- tags:设计,字典树,字符串,数据流,排序,堆(优先队列) -->
66

77
## 题目描述
88

‎solution/0600-0699/0642.Design Search Autocomplete System/README_EN.md‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@
22

33
[中文文档](/solution/0600-0699/0642.Design%20Search%20Autocomplete%20System/README.md)
44

5-
<!-- tags:Design,Trie,String,Data Stream -->
5+
<!-- tags:Design,Trie,String,Data Stream,Sorting,Heap (Priority Queue) -->
66

77
## Description
88

‎solution/0600-0699/0647.Palindromic Substrings/README.md‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@
22

33
[English Version](/solution/0600-0699/0647.Palindromic%20Substrings/README_EN.md)
44

5-
<!-- tags:字符串,动态规划 -->
5+
<!-- tags:双指针,字符串,动态规划 -->
66

77
## 题目描述
88

‎solution/0600-0699/0647.Palindromic Substrings/README_EN.md‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@
22

33
[中文文档](/solution/0600-0699/0647.Palindromic%20Substrings/README.md)
44

5-
<!-- tags:String,Dynamic Programming -->
5+
<!-- tags:Two Pointers,String,Dynamic Programming -->
66

77
## Description
88

‎solution/0900-0999/0924.Minimize Malware Spread/README.md‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@
22

33
[English Version](/solution/0900-0999/0924.Minimize%20Malware%20Spread/README_EN.md)
44

5-
<!-- tags:深度优先搜索,广度优先搜索,并查集,图,哈希表 -->
5+
<!-- tags:深度优先搜索,广度优先搜索,并查集,图,数组,哈希表 -->
66

77
## 题目描述
88

‎solution/0900-0999/0924.Minimize Malware Spread/README_EN.md‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@
22

33
[中文文档](/solution/0900-0999/0924.Minimize%20Malware%20Spread/README.md)
44

5-
<!-- tags:Depth-First Search,Breadth-First Search,Union Find,Graph,Hash Table -->
5+
<!-- tags:Depth-First Search,Breadth-First Search,Union Find,Graph,Array,Hash Table -->
66

77
## Description
88

‎solution/0900-0999/0928.Minimize Malware Spread II/README.md‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@
22

33
[English Version](/solution/0900-0999/0928.Minimize%20Malware%20Spread%20II/README_EN.md)
44

5-
<!-- tags:深度优先搜索,广度优先搜索,并查集,图,哈希表 -->
5+
<!-- tags:深度优先搜索,广度优先搜索,并查集,图,数组,哈希表 -->
66

77
## 题目描述
88

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /