feat: generate English README for leetcode questions

生成 README_EN 文件

Author: yanglbme

solution/0001.Two Sum/README_EN.md

@@ -0,0 +1,41 @@
+# [1. Two Sum](https://leetcode.com/problems/two-sum)
+
+## Description
+<p>Given an array of integers, return <strong>indices</strong> of the two numbers such that they add up to a specific target.</p>
+
+<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>
+
+<p><strong>Example:</strong></p>
+
+<pre>
+Given nums = [2, 7, 11, 15], target = 9,
+
+Because nums[<strong>0</strong>] + nums[<strong>1</strong>] = 2 + 7 = 9,
+return [<strong>0</strong>, <strong>1</strong>].
+</pre>
+
+
+
+## Solution
+<!-- Type common method here -->
+
+
+### Python3
+<!-- Type special method here -->
+
+```python
+
+```
+
+### Java
+<!-- Type special method here -->
+
+```java
+
+```
+
+### ...
+```
+
+```
+

solution/0002.Add Two Numbers/README_EN.md

@@ -0,0 +1,40 @@
+# [2. Add Two Numbers](https://leetcode.com/problems/add-two-numbers)
+
+## Description
+<p>You are given two <b>non-empty</b> linked lists representing two non-negative integers. The digits are stored in <b>reverse order</b> and each of their nodes contain a single digit. Add the two numbers and return it as a linked list.</p>
+
+<p>You may assume the two numbers do not contain any leading zero, except the number 0 itself.</p>
+
+<p><b>Example:</b></p>
+
+<pre>
+<b>Input:</b> (2 -&gt; 4 -&gt; 3) + (5 -&gt; 6 -&gt; 4)
+<b>Output:</b> 7 -&gt; 0 -&gt; 8
+<b>Explanation:</b> 342 + 465 = 807.
+</pre>
+
+
+
+## Solution
+<!-- Type common method here -->
+
+
+### Python3
+<!-- Type special method here -->
+
+```python
+
+```
+
+### Java
+<!-- Type special method here -->
+
+```java
+
+```
+
+### ...
+```
+
+```
+