feat: update lcci questions

更新《程序员面试金典》题目

Author: yanglbme

README.md

@@ -22,8 +22,6 @@
 - GitHub Pages: https://doocs.github.io/leetcode
 - Coding Pages: https://d3jc40.coding-pages.com
 
-注：对于国内（中国）的朋友，推荐访问 [Coding Pages](https://d3jc40.coding-pages.com)，页面加载速度最快。
-
 ## 题解
 - [LeetCode](/solution/README.md)
 - [LeetCode 《剑指 Offer（第 2 版）》](/lcof/README.md)
@@ -33,7 +31,7 @@
 [Yang Libin](https://github.com/yanglbme): GitHub 技术社区 [@Doocs](https://github.com/doocs) 创建者；[@TheAlgorithms](https://github.com/TheAlgorithms) 组织成员。
 
 ## 加入我们
-刷编程题的最大好处就是**可以锻炼解决问题的思维能力**。相信我，「如何去思考」​本身也是一项需要不断学习和练习的技能。非常感谢前微软工程师、现蚂蚁金服技术专家 [@kfstorm](https://github.com/kfstorm) 贡献了本项目的所有 [C# 题解](https://github.com/doocs/leetcode/pull/245)。
+刷编程题的最大好处就是可以锻炼解决问题的思维能力。相信我，「如何去思考」​本身也是一项需要不断学习和练习的技能。非常感谢前微软工程师、现蚂蚁金服技术专家 [@kfstorm](https://github.com/kfstorm) 贡献了本项目的所有 [C# 题解](https://github.com/doocs/leetcode/pull/245)。
 
 如果你对本项目感兴趣，并且希望加入我们刷题大军，欢迎随时提交 [PR](https://github.com/doocs/leetcode/pulls)。请参考如下步骤：
 

lcci/01.01.Is Unique/README_EN.md

@@ -3,12 +3,8 @@
 ## Description
 <p>Implement an algorithm to determine if a string has all unique characters. What if you cannot use additional data structures?</p>
 
-
-
 <p><strong>Example 1:</strong></p>
 
-
-
 <pre>
 
 <strong>Input: </strong><code>s</code> = &quot;leetcode&quot;
@@ -17,12 +13,8 @@
 
 </pre>
 
-
-
 <p><strong>Example 2:</strong></p>
 
-
-
 <pre>
 
 <strong>Input: </strong><code>s</code> = &quot;abc&quot;
@@ -31,20 +23,10 @@
 
 </pre>
 
-
-
-<p>&nbsp;</p>
-
-
-
 <p><strong>Note:</strong></p>
 
-
-
 <ul>
-
 	<li><code>0 &lt;= len(s) &lt;= 100 </code></li>
-
 </ul>
 
 

lcci/01.02.Check Permutation/README_EN.md

@@ -34,15 +34,9 @@
 
 
 <p><strong>Note:</strong></p>
-
-
-
 <ol>
-
 	<li><code>0 &lt;= len(s1) &lt;= 100 </code></li>
-
 	<li><code>0 &lt;= len(s2) &lt;= 100</code></li>
-
 </ol>
 
 

lcci/01.03.String to URL/README_EN.md

@@ -46,9 +46,7 @@ The missing numbers are [5,6,8,...], hence the third missing number is 8.
 
 
 <ol>
-
 	<li><code>0 &lt;= S.length &lt;= 500000</code></li>
-
 </ol>
 
 

lcci/01.04.Palindrome Permutation/README_EN.md

@@ -21,13 +21,6 @@
 
 </pre>
 
-
-
-<p>&nbsp;</p>
-
-
-
-
 ## Solutions
 
 

lcci/01.05.One Away/README_EN.md

@@ -3,16 +3,8 @@
 ## Description
 <p>There are three types of edits that can be performed on strings: insert a character, remove a character, or replace a character. Given two strings, write a function to check if they are one edit (or zero edits) away.</p>
 
-
-
-<p>&nbsp;</p>
-
-
-
 <p><strong>Example&nbsp;1:</strong></p>
 
-
-
 <pre>
 
 <strong>Input:</strong> 
@@ -25,8 +17,6 @@ second = &quot;ple&quot;
 
 </pre>
 
-
-
 <p><strong>Example&nbsp;2:</strong></p>
 
 

lcci/01.06.Compress String/README_EN.md

@@ -7,8 +7,6 @@
 
 <p><strong>Example 1:</strong></p>
 
-
-
 <pre>
 
 <strong>Input: </strong>&quot;aabcccccaaa&quot;
@@ -35,8 +33,6 @@ The compressed string is &quot;a1b2c2d1&quot;, which is longer than the original
 
 </pre>
 
-<p>&nbsp;</p>
-
 <p><strong>Note:</strong></p>
 
 - `0 <= S.length <= 50000`

lcci/01.09.String Rotation/README_EN.md

@@ -42,9 +42,7 @@
 
 
 <ol>
-
 	<li><code><font face="monospace">0 &lt;= s1.length, s1.length &lt;=&nbsp;</font>100000</code></li>
-
 </ol>
 
 

lcci/02.01.Remove Duplicate Node/README_EN.md

@@ -3,12 +3,9 @@
 ## Description
 <p>Write code to remove duplicates from an unsorted linked list.</p>
 
-
-
 <p><strong>Example1:</strong></p>
 
 
-
 <pre>
 
 <strong> Input</strong>: [1, 2, 3, 3, 2, 1]
@@ -18,11 +15,8 @@
 </pre>
 
 
-
 <p><strong>Example2:</strong></p>
 
-
-
 <pre>
 
 <strong> Input</strong>: [1, 1, 1, 1, 2]
@@ -31,18 +25,12 @@
 
 </pre>
 
-
-
 <p><strong>Note: </strong></p>
 
-
-
 <ol>
-
 	<li>The length of the list is within the range[0, 20000].</li>
 
 	<li>The values of the list elements are within the range [0, 20000].</li>
-
 </ol>
 
 

lcci/02.02.Kth Node From End of List/README_EN.md

@@ -23,13 +23,9 @@
 
 <p><strong>Note: </strong></p>
 
-
-
 <p>k is always valid.</p>
 
 
-
-
 ## Solutions
 
 

lcci/03.04.Implement Queue using Stacks/README_EN.md

@@ -38,13 +38,9 @@ queue.empty(); // return false</pre>
 
 
 <ul>
-
 	<li>You must use&nbsp;<i>only</i>&nbsp;standard operations of a stack -- which means only&nbsp;<code>push to top</code>,&nbsp;<code>peek/pop from top</code>,&nbsp;<code>size</code>, and&nbsp;<code>is empty</code>&nbsp;operations are valid.</li>
-
 	<li>Depending on your language, stack may not be supported natively. You may simulate a stack by using a list or deque (double-ended queue), as long as you use only standard operations of a stack.</li>
-
 	<li>You may assume that all operations are valid (for example, no pop or peek operations will be called on an empty queue).</li>
-
 </ul>
 
 

lcci/03.05.Sort of Stacks/README_EN.md

@@ -50,9 +50,7 @@
 
 
 <ol>
-
 	<li>The total number of elements in the stack is within the range [0, 5000].</li>
-
 </ol>
 
 

lcci/03.06.Animal Shelter/README_EN.md

@@ -58,9 +58,7 @@
 
 
 <ol>
-
 	<li>The number of animals in the shelter will not exceed 20000.</li>
-
 </ol>
 
 

lcci/04.01.Route Between Nodes/README_EN.md

@@ -1,48 +1,67 @@
-# [04.01. Route Between Nodes](https://leetcode-cn.com/problems/route-between-nodes-lcci)
-
-## Description
-<p>Given a directed graph, design an algorithm to find out whether there is a route between two nodes.</p>
-
-<p><strong>Example1:</strong></p>
-
-<pre>
-<strong> Input</strong>: n = 3, graph = [[0, 1], [0, 2], [1, 2], [1, 2]], start = 0, target = 2
-<strong> Output</strong>: true
-</pre>
-
-<p><strong>Example2:</strong></p>
-
-<pre>
-<strong> Input</strong>: n = 5, graph = [[0, 1], [0, 2], [0, 4], [0, 4], [0, 1], [1, 3], [1, 4], [1, 3], [2, 3], [3, 4]], start = 0, target = 4
-<strong> Output</strong> true
-</pre>
-
-<p><strong>Note: </strong></p>
-
-<ol>
-	<li><code>0 &lt;= n &lt;= 100000</code></li>
-	<li>All node numbers are within the range [0, n].</li>
-	<li>There might be self cycles and duplicated edges.</li>
-</ol>
-
-
-
-## Solutions
-
-
-### Python3
-
-```python
-
-```
-
-### Java
-
-```java
-
-```
-
-### ...
-```
-
-```
+# [04.01. Route Between Nodes](https://leetcode-cn.com/problems/route-between-nodes-lcci)
+
+## Description
+<p>Given a directed graph, design an algorithm to find out whether there is a route between two nodes.</p>
+
+
+
+<p><strong>Example1:</strong></p>
+
+
+
+<pre>
+
+<strong> Input</strong>: n = 3, graph = [[0, 1], [0, 2], [1, 2], [1, 2]], start = 0, target = 2
+
+<strong> Output</strong>: true
+
+</pre>
+
+
+
+<p><strong>Example2:</strong></p>
+
+
+
+<pre>
+
+<strong> Input</strong>: n = 5, graph = [[0, 1], [0, 2], [0, 4], [0, 4], [0, 1], [1, 3], [1, 4], [1, 3], [2, 3], [3, 4]], start = 0, target = 4
+
+<strong> Output</strong> true
+
+</pre>
+
+
+
+<p><strong>Note: </strong></p>
+
+
+
+<ol>
+	<li><code>0 &lt;= n &lt;= 100000</code></li>
+	<li>All node numbers are within the range [0, n].</li>
+	<li>There might be self cycles and duplicated edges.</li>
+</ol>
+
+
+
+
+## Solutions
+
+
+### Python3
+
+```python
+
+```
+
+### Java
+
+```java
+
+```
+
+### ...
+```
+
+```

lcci/04.08.First Common Ancestor/README_EN.md

@@ -59,14 +59,9 @@
 
 <p><strong>Notes:</strong></p>
 
-
-
 <ul>
-
 	<li>All node values are pairwise distinct.</li>
-
 	<li>p, q are different node and both can be found in the given tree.</li>
-
 </ul>