Skip to content

chore: update lc problems: No.0263,No.0266,No.0267,No.0269,No.0274,No… #1509

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
Aug 25, 2023
Merged

chore: update lc problems: No.0263,No.0266,No.0267,No.0269,No.0274,No… #1509

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion solution/0200-0299/0263.Ugly Number/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -31,7 +31,7 @@
<pre>
<strong>输入：</strong>n = 14
<strong>输出：</strong>false
<strong>解释：</strong>14 不是丑数，因为它包含了另外一个质因数&nbsp;<code>7 </code>。
<strong>解释：</strong>14 不是丑数，因为它包含了另外一个质因数&nbsp;7 。
</pre>

<p>&nbsp;</p>
Expand Down
6 changes: 3 additions & 3 deletions solution/0200-0299/0266.Palindrome Permutation/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -10,17 +10,17 @@

<p><strong>示例 1：</strong></p>

<pre><strong>输入:</strong> <code>&quot;code&quot;</code>
<pre><strong>输入:</strong> &quot;code&quot;
<strong>输出:</strong> false</pre>

<p><strong>示例 2：</strong></p>

<pre><strong>输入:</strong> <code>&quot;aab&quot;</code>
<pre><strong>输入:</strong> &quot;aab&quot;
<strong>输出:</strong> true</pre>

<p><strong>示例 3：</strong></p>

<pre><strong>输入:</strong> <code>&quot;carerac&quot;</code>
<pre><strong>输入:</strong> &quot;carerac&quot;
<strong>输出:</strong> true</pre>

## 解法
Expand Down
8 changes: 4 additions & 4 deletions solution/0200-0299/0267.Palindrome Permutation II/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -15,14 +15,14 @@
<p><strong>示例 1：</strong></p>

<pre>
<strong>输入: </strong>s = <code>"aabb"</code>
<strong>输出: </strong><code>["abba", "baab"]</code></pre>
<strong>输入: </strong>s = "aabb"
<strong>输出: </strong>["abba", "baab"]></pre>

<p><strong>示例 2：</strong></p>

<pre>
<strong>输入: </strong>s = <code>"abc"</code>
<strong>输出: </strong><code>[]</code>
<strong>输入: </strong>s = "abc"
<strong>输出: </strong>[]
</pre>

<p>&nbsp;</p>
Expand Down
2 changes: 1 addition & 1 deletion solution/0200-0299/0269.Alien Dictionary/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -35,7 +35,7 @@
<pre>
<strong>输入：</strong>words = ["z","x","z"]
<strong>输出：</strong>""
<strong>解释：</strong>不存在合法字母顺序，因此返回 <code>"" 。</code>
<strong>解释：</strong>不存在合法字母顺序，因此返回 "" 。
</pre>

<p>&nbsp;</p>
Expand Down
2 changes: 1 addition & 1 deletion solution/0200-0299/0269.Alien Dictionary/README_EN.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -32,7 +32,7 @@
<pre>
<strong>Input:</strong> words = [&quot;z&quot;,&quot;x&quot;,&quot;z&quot;]
<strong>Output:</strong> &quot;&quot;
<strong>Explanation:</strong> The order is invalid, so return <code>&quot;&quot;</code>.
<strong>Explanation:</strong> The order is invalid, so return &quot;&quot;.
</pre>

<p>&nbsp;</p>
Expand Down
6 changes: 3 additions & 3 deletions solution/0200-0299/0274.H-Index/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -15,10 +15,10 @@
<p><strong>示例 1：</strong></p>

<pre>
<strong>输入：</strong><code>citations = [3,0,6,1,5]</code>
<strong>输入：</strong>citations = [3,0,6,1,5]
<strong>输出：</strong>3
<strong>解释：</strong>给定数组表示研究者总共有 <code>5</code> 篇论文，每篇论文相应的被引用了 <code>3, 0, 6, 1, 5</code> 次。
&nbsp; 由于研究者有 <code>3 </code>篇论文每篇 <strong>至少 </strong>被引用了 <code>3</code> 次，其余两篇论文每篇被引用 <strong>不多于</strong> <code>3</code> 次，所以她的 <em>h </em>指数是 <code>3</code>。</pre>
<strong>解释：</strong>给定数组表示研究者总共有 5 篇论文，每篇论文相应的被引用了 3, 0, 6, 1, 5 次。
&nbsp; 由于研究者有 3 篇论文每篇 <strong>至少 </strong>被引用了 3 次，其余两篇论文每篇被引用 <strong>不多于</strong> 3 次，所以她的 <em>h </em>指数是 3。</pre>

<p><strong>示例 2：</strong></p>

Expand Down
6 changes: 3 additions & 3 deletions solution/0200-0299/0275.H-Index II/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -17,10 +17,10 @@
<p><strong class="example">示例 1：</strong></p>

<pre>
<strong>输入<code>：</code></strong><code>citations = [0,1,3,5,6]</code>
<strong>输入：</strong>citations = [0,1,3,5,6]
<strong>输出：</strong>3
<strong>解释：</strong>给定数组表示研究者总共有 <code>5</code> 篇论文，每篇论文相应的被引用了 0<code>, 1, 3, 5, 6</code> 次。
&nbsp; 由于研究者有 <code>3 </code>篇论文每篇<strong> 至少 </strong>被引用了 <code>3</code> 次，其余两篇论文每篇被引用<strong> 不多于</strong> <code>3</code> 次，所以她的<em> h </em>指数是 <code>3</code> 。</pre>
<strong>解释：</strong>给定数组表示研究者总共有 5 篇论文，每篇论文相应的被引用了 0, 1, 3, 5, 6 次。
&nbsp; 由于研究者有 3 篇论文每篇<strong> 至少 </strong>被引用了 3 次，其余两篇论文每篇被引用<strong> 不多于</strong> 3 次，所以她的<em> h </em>指数是 3 。</pre>

<p><strong class="example">示例 2：</strong></p>

Expand Down
6 changes: 6 additions & 0 deletions solution/config.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -12,6 +12,12 @@
258,
259,
261,
263,
266,
267,
269,
274,
275,
279,
280,
281,
Expand Down