docs: update README.md

solution/0000-0099/0001.Two Sum/README.md

@@ -1,5 +1,7 @@
 # [1. 两数之和](https://leetcode-cn.com/problems/two-sum)
 
+[English Version](/solution/0000-0099/0001.Two%20Sum/README_EN.md)
+
 ## 题目描述
 <!-- 这里写题目描述 -->
 <p>给定一个整数数组 <code>nums</code>&nbsp;和一个目标值 <code>target</code>，请你在该数组中找出和为目标值的那&nbsp;<strong>两个</strong>&nbsp;整数，并返回他们的数组下标。</p>

solution/0000-0099/0001.Two Sum/README_EN.md

@@ -1,5 +1,7 @@
 # [1. Two Sum](https://leetcode.com/problems/two-sum)
 
+[中文文档](/solution/0000-0099/0001.Two%20Sum/README.md)
+
 ## 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>
 

solution/0000-0099/0002.Add Two Numbers/README.md

@@ -1,5 +1,7 @@
 # [2. 两数相加](https://leetcode-cn.com/problems/add-two-numbers)
 
+[English Version](/solution/0000-0099/0002.Add%20Two%20Numbers/README_EN.md)
+
 ## 题目描述
 <!-- 这里写题目描述 -->
 <p>给出两个&nbsp;<strong>非空</strong> 的链表用来表示两个非负的整数。其中，它们各自的位数是按照&nbsp;<strong>逆序</strong>&nbsp;的方式存储的，并且它们的每个节点只能存储&nbsp;<strong>一位</strong>&nbsp;数字。</p>

solution/0000-0099/0002.Add Two Numbers/README_EN.md

@@ -1,5 +1,7 @@
 # [2. Add Two Numbers](https://leetcode.com/problems/add-two-numbers)
 
+[中文文档](/solution/0000-0099/0002.Add%20Two%20Numbers/README.md)
+
 ## 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>
 

solution/0000-0099/0003.Longest Substring Without Repeating Characters/README.md

@@ -1,5 +1,7 @@
 # [3. 无重复字符的最长子串](https://leetcode-cn.com/problems/longest-substring-without-repeating-characters)
 
+[English Version](/solution/0000-0099/0003.Longest%20Substring%20Without%20Repeating%20Characters/README_EN.md)
+
 ## 题目描述
 <!-- 这里写题目描述 -->
 <p>给定一个字符串，请你找出其中不含有重复字符的&nbsp;<strong>最长子串&nbsp;</strong>的长度。</p>

solution/0000-0099/0003.Longest Substring Without Repeating Characters/README_EN.md

@@ -1,5 +1,7 @@
 # [3. Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters)
 
+[中文文档](/solution/0000-0099/0003.Longest%20Substring%20Without%20Repeating%20Characters/README.md)
+
 ## Description
 <p>Given a string, find the length of the <b>longest substring</b> without repeating characters.</p>
 

solution/0000-0099/0004.Median of Two Sorted Arrays/README.md

@@ -1,5 +1,7 @@
 # [4. 寻找两个有序数组的中位数](https://leetcode-cn.com/problems/median-of-two-sorted-arrays)
 
+[English Version](/solution/0000-0099/0004.Median%20of%20Two%20Sorted%20Arrays/README_EN.md)
+
 ## 题目描述
 <!-- 这里写题目描述 -->
 <p>给定两个大小为 m 和 n 的有序数组&nbsp;<code>nums1</code> 和&nbsp;<code>nums2</code>。</p>

solution/0000-0099/0004.Median of Two Sorted Arrays/README_EN.md

@@ -1,5 +1,7 @@
 # [4. Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays)
 
+[中文文档](/solution/0000-0099/0004.Median%20of%20Two%20Sorted%20Arrays/README.md)
+
 ## Description
 <p>There are two sorted arrays <b>nums1</b> and <b>nums2</b> of size m and n respectively.</p>
 

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

@@ -1,5 +1,7 @@
 # [5. 最长回文子串](https://leetcode-cn.com/problems/longest-palindromic-substring)
 
+[English Version](/solution/0000-0099/0005.Longest%20Palindromic%20Substring/README_EN.md)
+
 ## 题目描述
 <!-- 这里写题目描述 -->
 <p>给定一个字符串 <code>s</code>，找到 <code>s</code> 中最长的回文子串。你可以假设&nbsp;<code>s</code> 的最大长度为 1000。</p>

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

@@ -1,5 +1,7 @@
 # [5. Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring)
 
+[中文文档](/solution/0000-0099/0005.Longest%20Palindromic%20Substring/README.md)
+
 ## Description
 <p>Given a string <strong>s</strong>, find the longest palindromic substring in <strong>s</strong>. You may assume that the maximum length of <strong>s</strong> is 1000.</p>
 

solution/0000-0099/0006.ZigZag Conversion/README.md

@@ -1,5 +1,7 @@
 # [6. Z 字形变换](https://leetcode-cn.com/problems/zigzag-conversion)
 
+[English Version](/solution/0000-0099/0006.ZigZag%20Conversion/README_EN.md)
+
 ## 题目描述
 <!-- 这里写题目描述 -->
 <p>将一个给定字符串根据给定的行数，以从上往下、从左到右进行&nbsp;Z 字形排列。</p>

solution/0000-0099/0006.ZigZag Conversion/README_EN.md

@@ -1,5 +1,7 @@
 # [6. ZigZag Conversion](https://leetcode.com/problems/zigzag-conversion)
 
+[中文文档](/solution/0000-0099/0006.ZigZag%20Conversion/README.md)
+
 ## Description
 <p>The string <code>&quot;PAYPALISHIRING&quot;</code> is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility)</p>
 

solution/0000-0099/0007.Reverse Integer/README.md

@@ -1,5 +1,7 @@
 # [7. 整数反转](https://leetcode-cn.com/problems/reverse-integer)
 
+[English Version](/solution/0000-0099/0007.Reverse%20Integer/README_EN.md)
+
 ## 题目描述
 <!-- 这里写题目描述 -->
 <p>给出一个 32 位的有符号整数，你需要将这个整数中每位上的数字进行反转。</p>

solution/0000-0099/0007.Reverse Integer/README_EN.md

@@ -1,5 +1,7 @@
 # [7. Reverse Integer](https://leetcode.com/problems/reverse-integer)
 
+[中文文档](/solution/0000-0099/0007.Reverse%20Integer/README.md)
+
 ## Description
 <p>Given a 32-bit signed integer, reverse digits of an integer.</p>
 

solution/0000-0099/0008.String to Integer (atoi)/README.md

@@ -1,5 +1,7 @@
 # [8. 字符串转换整数 (atoi)](https://leetcode-cn.com/problems/string-to-integer-atoi)
 
+[English Version](/solution/0000-0099/0008.String%20to%20Integer%20(atoi)/README_EN.md)
+
 ## 题目描述
 <!-- 这里写题目描述 -->
 <p>请你来实现一个&nbsp;<code>atoi</code>&nbsp;函数，使其能将字符串转换成整数。</p>

solution/0000-0099/0008.String to Integer (atoi)/README_EN.md

@@ -1,5 +1,7 @@
 # [8. String to Integer (atoi)](https://leetcode.com/problems/string-to-integer-atoi)
 
+[中文文档](/solution/0000-0099/0008.String%20to%20Integer%20(atoi)/README.md)
+
 ## Description
 <p>Implement <code><span>atoi</span></code> which&nbsp;converts a string to an integer.</p>
 

solution/0000-0099/0009.Palindrome Number/README.md

@@ -1,5 +1,7 @@
 # [9. 回文数](https://leetcode-cn.com/problems/palindrome-number)
 
+[English Version](/solution/0000-0099/0009.Palindrome%20Number/README_EN.md)
+
 ## 题目描述
 <!-- 这里写题目描述 -->
 <p>判断一个整数是否是回文数。回文数是指正序（从左向右）和倒序（从右向左）读都是一样的整数。</p>

solution/0000-0099/0009.Palindrome Number/README_EN.md

@@ -1,5 +1,7 @@
 # [9. Palindrome Number](https://leetcode.com/problems/palindrome-number)
 
+[中文文档](/solution/0000-0099/0009.Palindrome%20Number/README.md)
+
 ## Description
 <p>Determine whether an integer is a palindrome. An integer&nbsp;is&nbsp;a&nbsp;palindrome when it&nbsp;reads the same backward as forward.</p>
 

solution/0000-0099/0010.Regular Expression Matching/README.md

@@ -1,5 +1,7 @@
 # [10. 正则表达式匹配](https://leetcode-cn.com/problems/regular-expression-matching)
 
+[English Version](/solution/0000-0099/0010.Regular%20Expression%20Matching/README_EN.md)
+
 ## 题目描述
 <!-- 这里写题目描述 -->
 <p>给你一个字符串&nbsp;<code>s</code>&nbsp;和一个字符规律&nbsp;<code>p</code>，请你来实现一个支持 <code>&#39;.&#39;</code>&nbsp;和&nbsp;<code>&#39;*&#39;</code>&nbsp;的正则表达式匹配。</p>

solution/0000-0099/0010.Regular Expression Matching/README_EN.md

@@ -1,5 +1,7 @@
 # [10. Regular Expression Matching](https://leetcode.com/problems/regular-expression-matching)
 
+[中文文档](/solution/0000-0099/0010.Regular%20Expression%20Matching/README.md)
+
 ## Description
 <p>Given an input string (<code>s</code>) and a pattern (<code>p</code>), implement regular expression matching with support for <code>&#39;.&#39;</code> and <code>&#39;*&#39;</code>.</p>
 

solution/0000-0099/0011.Container With Most Water/README.md

@@ -1,5 +1,7 @@
 # [11. 盛最多水的容器](https://leetcode-cn.com/problems/container-with-most-water)
 
+[English Version](/solution/0000-0099/0011.Container%20With%20Most%20Water/README_EN.md)
+
 ## 题目描述
 <!-- 这里写题目描述 -->
 <p>给你 <em>n</em> 个非负整数 <em>a</em><sub>1</sub>，<em>a</em><sub>2，</sub>...，<em>a</em><sub>n，</sub>每个数代表坐标中的一个点&nbsp;(<em>i</em>,&nbsp;<em>a<sub>i</sub></em>) 。在坐标内画 <em>n</em> 条垂直线，垂直线 <em>i</em>&nbsp;的两个端点分别为&nbsp;(<em>i</em>,&nbsp;<em>a<sub>i</sub></em>) 和 (<em>i</em>, 0)。找出其中的两条线，使得它们与&nbsp;<em>x</em>&nbsp;轴共同构成的容器可以容纳最多的水。</p>

solution/0000-0099/0011.Container With Most Water/README_EN.md

@@ -1,5 +1,7 @@
 # [11. Container With Most Water](https://leetcode.com/problems/container-with-most-water)
 
+[中文文档](/solution/0000-0099/0011.Container%20With%20Most%20Water/README.md)
+
 ## Description
 <p>Given <i>n</i> non-negative integers <i>a<sub>1</sub></i>, <i>a<sub>2</sub></i>, ..., <i>a<sub>n&nbsp;</sub></i>, where each represents a point at coordinate (<i>i</i>, <i>a<sub>i</sub></i>). <i>n</i> vertical lines are drawn such that the two endpoints of line <i>i</i> is at (<i>i</i>, <i>a<sub>i</sub></i>) and (<i>i</i>, 0). Find two lines, which together with x-axis forms a container, such that the container contains the most water.</p>
 

solution/0000-0099/0012.Integer to Roman/README.md

@@ -1,5 +1,7 @@
 # [12. 整数转罗马数字](https://leetcode-cn.com/problems/integer-to-roman)
 
+[English Version](/solution/0000-0099/0012.Integer%20to%20Roman/README_EN.md)
+
 ## 题目描述
 <!-- 这里写题目描述 -->
 <p>罗马数字包含以下七种字符：&nbsp;<code>I</code>，&nbsp;<code>V</code>，&nbsp;<code>X</code>，&nbsp;<code>L</code>，<code>C</code>，<code>D</code>&nbsp;和&nbsp;<code>M</code>。</p>

solution/0000-0099/0012.Integer to Roman/README_EN.md

@@ -1,5 +1,7 @@
 # [12. Integer to Roman](https://leetcode.com/problems/integer-to-roman)
 
+[中文文档](/solution/0000-0099/0012.Integer%20to%20Roman/README.md)
+
 ## Description
 <p>Roman numerals are represented by seven different symbols:&nbsp;<code>I</code>, <code>V</code>, <code>X</code>, <code>L</code>, <code>C</code>, <code>D</code> and <code>M</code>.</p>
 

solution/0000-0099/0013.Roman to Integer/README.md

@@ -1,5 +1,7 @@
 # [13. 罗马数字转整数](https://leetcode-cn.com/problems/roman-to-integer)
 
+[English Version](/solution/0000-0099/0013.Roman%20to%20Integer/README_EN.md)
+
 ## 题目描述
 <!-- 这里写题目描述 -->
 <p>罗马数字包含以下七种字符:&nbsp;<code>I</code>，&nbsp;<code>V</code>，&nbsp;<code>X</code>，&nbsp;<code>L</code>，<code>C</code>，<code>D</code>&nbsp;和&nbsp;<code>M</code>。</p>

solution/0000-0099/0013.Roman to Integer/README_EN.md

@@ -1,5 +1,7 @@
 # [13. Roman to Integer](https://leetcode.com/problems/roman-to-integer)
 
+[中文文档](/solution/0000-0099/0013.Roman%20to%20Integer/README.md)
+
 ## Description
 <p>Roman numerals are represented by seven different symbols:&nbsp;<code>I</code>, <code>V</code>, <code>X</code>, <code>L</code>, <code>C</code>, <code>D</code> and <code>M</code>.</p>
 

solution/0000-0099/0014.Longest Common Prefix/README.md

@@ -1,5 +1,7 @@
 # [14. 最长公共前缀](https://leetcode-cn.com/problems/longest-common-prefix)
 
+[English Version](/solution/0000-0099/0014.Longest%20Common%20Prefix/README_EN.md)
+
 ## 题目描述
 <!-- 这里写题目描述 -->
 <p>编写一个函数来查找字符串数组中的最长公共前缀。</p>

solution/0000-0099/0014.Longest Common Prefix/README_EN.md

@@ -1,5 +1,7 @@
 # [14. Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix)
 
+[中文文档](/solution/0000-0099/0014.Longest%20Common%20Prefix/README.md)
+
 ## Description
 <p>Write a function to find the longest common prefix string amongst an array of strings.</p>
 

solution/0000-0099/0015.3Sum/README.md

@@ -1,5 +1,7 @@
 # [15. 三数之和](https://leetcode-cn.com/problems/3sum)
 
+[English Version](/solution/0000-0099/0015.3Sum/README_EN.md)
+
 ## 题目描述
 <!-- 这里写题目描述 -->
 <p>给你一个包含 <em>n</em> 个整数的数组&nbsp;<code>nums</code>，判断&nbsp;<code>nums</code>&nbsp;中是否存在三个元素 <em>a，b，c ，</em>使得&nbsp;<em>a + b + c = </em>0 ？请你找出所有满足条件且不重复的三元组。</p>

solution/0000-0099/0015.3Sum/README_EN.md

@@ -1,5 +1,7 @@
 # [15. 3Sum](https://leetcode.com/problems/3sum)
 
+[中文文档](/solution/0000-0099/0015.3Sum/README.md)
+
 ## Description
 <p>Given an array <code>nums</code> of <em>n</em> integers, are there elements <em>a</em>, <em>b</em>, <em>c</em> in <code>nums</code> such that <em>a</em> + <em>b</em> + <em>c</em> = 0? Find all unique triplets in the array which gives the sum of zero.</p>
 

solution/0000-0099/0016.3Sum Closest/README.md

@@ -1,5 +1,7 @@
 # [16. 最接近的三数之和](https://leetcode-cn.com/problems/3sum-closest)
 
+[English Version](/solution/0000-0099/0016.3Sum%20Closest/README_EN.md)
+
 ## 题目描述
 <!-- 这里写题目描述 -->
 <p>给定一个包括&nbsp;<em>n</em> 个整数的数组&nbsp;<code>nums</code><em>&nbsp;</em>和 一个目标值&nbsp;<code>target</code>。找出&nbsp;<code>nums</code><em>&nbsp;</em>中的三个整数，使得它们的和与&nbsp;<code>target</code>&nbsp;最接近。返回这三个数的和。假定每组输入只存在唯一答案。</p>

solution/0000-0099/0016.3Sum Closest/README_EN.md

@@ -1,5 +1,7 @@
 # [16. 3Sum Closest](https://leetcode.com/problems/3sum-closest)
 
+[中文文档](/solution/0000-0099/0016.3Sum%20Closest/README.md)
+
 ## Description
 <p>Given an array <code>nums</code> of <em>n</em> integers and an integer <code>target</code>, find three integers in <code>nums</code>&nbsp;such that the sum is closest to&nbsp;<code>target</code>. Return the sum of the three integers. You may assume that each input would have exactly one solution.</p>
 

solution/0000-0099/0017.Letter Combinations of a Phone Number/README.md

@@ -1,5 +1,7 @@
 # [17. 电话号码的字母组合](https://leetcode-cn.com/problems/letter-combinations-of-a-phone-number)
 
+[English Version](/solution/0000-0099/0017.Letter%20Combinations%20of%20a%20Phone%20Number/README_EN.md)
+
 ## 题目描述
 <!-- 这里写题目描述 -->
 <p>给定一个仅包含数字&nbsp;<code>2-9</code>&nbsp;的字符串，返回所有它能表示的字母组合。</p>

solution/0000-0099/0017.Letter Combinations of a Phone Number/README_EN.md

@@ -1,5 +1,7 @@
 # [17. Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number)
 
+[中文文档](/solution/0000-0099/0017.Letter%20Combinations%20of%20a%20Phone%20Number/README.md)
+
 ## Description
 <p>Given a string containing digits from <code>2-9</code> inclusive, return all possible letter combinations that the number could represent.</p>
 

solution/0000-0099/0018.4Sum/README.md

@@ -1,5 +1,7 @@
 # [18. 四数之和](https://leetcode-cn.com/problems/4sum)
 
+[English Version](/solution/0000-0099/0018.4Sum/README_EN.md)
+
 ## 题目描述
 <!-- 这里写题目描述 -->
 <p>给定一个包含&nbsp;<em>n</em> 个整数的数组&nbsp;<code>nums</code>&nbsp;和一个目标值&nbsp;<code>target</code>，判断&nbsp;<code>nums</code>&nbsp;中是否存在四个元素 <em>a，</em><em>b，c</em>&nbsp;和 <em>d</em>&nbsp;，使得&nbsp;<em>a</em> + <em>b</em> + <em>c</em> + <em>d</em>&nbsp;的值与&nbsp;<code>target</code>&nbsp;相等？找出所有满足条件且不重复的四元组。</p>

solution/0000-0099/0018.4Sum/README_EN.md

@@ -1,5 +1,7 @@
 # [18. 4Sum](https://leetcode.com/problems/4sum)
 
+[中文文档](/solution/0000-0099/0018.4Sum/README.md)
+
 ## Description
 <p>Given an array <code>nums</code> of <em>n</em> integers and an integer <code>target</code>, are there elements <em>a</em>, <em>b</em>, <em>c</em>, and <em>d</em> in <code>nums</code> such that <em>a</em> + <em>b</em> + <em>c</em> + <em>d</em> = <code>target</code>? Find all unique quadruplets in the array which gives the sum of <code>target</code>.</p>
 

solution/0000-0099/0019.Remove Nth Node From End of List/README.md

@@ -1,5 +1,7 @@
 # [19. 删除链表的倒数第N个节点](https://leetcode-cn.com/problems/remove-nth-node-from-end-of-list)
 
+[English Version](/solution/0000-0099/0019.Remove%20Nth%20Node%20From%20End%20of%20List/README_EN.md)
+
 ## 题目描述
 <!-- 这里写题目描述 -->
 <p>给定一个链表，删除链表的倒数第&nbsp;<em>n&nbsp;</em>个节点，并且返回链表的头结点。</p>

solution/0000-0099/0019.Remove Nth Node From End of List/README_EN.md

@@ -1,5 +1,7 @@
 # [19. Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list)
 
+[中文文档](/solution/0000-0099/0019.Remove%20Nth%20Node%20From%20End%20of%20List/README.md)
+
 ## Description
 <p>Given a linked list, remove the <em>n</em>-th node from the end of list and return its head.</p>
 

solution/0000-0099/0020.Valid Parentheses/README.md

@@ -1,5 +1,7 @@
 # [20. 有效的括号](https://leetcode-cn.com/problems/valid-parentheses)
 
+[English Version](/solution/0000-0099/0020.Valid%20Parentheses/README_EN.md)
+
 ## 题目描述
 <!-- 这里写题目描述 -->
 <p>给定一个只包括 <code>&#39;(&#39;</code>，<code>&#39;)&#39;</code>，<code>&#39;{&#39;</code>，<code>&#39;}&#39;</code>，<code>&#39;[&#39;</code>，<code>&#39;]&#39;</code>&nbsp;的字符串，判断字符串是否有效。</p>

solution/0000-0099/0020.Valid Parentheses/README_EN.md

@@ -1,5 +1,7 @@
 # [20. Valid Parentheses](https://leetcode.com/problems/valid-parentheses)
 
+[中文文档](/solution/0000-0099/0020.Valid%20Parentheses/README.md)
+
 ## Description
 <p>Given a string containing just the characters <code>&#39;(&#39;</code>, <code>&#39;)&#39;</code>, <code>&#39;{&#39;</code>, <code>&#39;}&#39;</code>, <code>&#39;[&#39;</code> and <code>&#39;]&#39;</code>, determine if the input string is valid.</p>
 

solution/0000-0099/0021.Merge Two Sorted Lists/README.md

@@ -1,5 +1,7 @@
 # [21. 合并两个有序链表](https://leetcode-cn.com/problems/merge-two-sorted-lists)
 
+[English Version](/solution/0000-0099/0021.Merge%20Two%20Sorted%20Lists/README_EN.md)
+
 ## 题目描述
 <!-- 这里写题目描述 -->
 <p>将两个有序链表合并为一个新的有序链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。&nbsp;</p>

solution/0000-0099/0021.Merge Two Sorted Lists/README_EN.md

@@ -1,5 +1,7 @@
 # [21. Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists)
 
+[中文文档](/solution/0000-0099/0021.Merge%20Two%20Sorted%20Lists/README.md)
+
 ## Description
 <p>Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.</p>
 

solution/0000-0099/0022.Generate Parentheses/README.md

@@ -1,5 +1,7 @@
 # [22. 括号生成](https://leetcode-cn.com/problems/generate-parentheses)
 
+[English Version](/solution/0000-0099/0022.Generate%20Parentheses/README_EN.md)
+
 ## 题目描述
 <!-- 这里写题目描述 -->
 <p>给出&nbsp;<em>n</em>&nbsp;代表生成括号的对数，请你写出一个函数，使其能够生成所有可能的并且<strong>有效的</strong>括号组合。</p>

solution/0000-0099/0022.Generate Parentheses/README_EN.md

@@ -1,5 +1,7 @@
 # [22. Generate Parentheses](https://leetcode.com/problems/generate-parentheses)
 
+[中文文档](/solution/0000-0099/0022.Generate%20Parentheses/README.md)
+
 ## Description
 <p>
 

solution/0000-0099/0023.Merge k Sorted Lists/README.md

@@ -1,5 +1,7 @@
 # [23. 合并K个排序链表](https://leetcode-cn.com/problems/merge-k-sorted-lists)
 
+[English Version](/solution/0000-0099/0023.Merge%20k%20Sorted%20Lists/README_EN.md)
+
 ## 题目描述
 <!-- 这里写题目描述 -->
 <p>合并&nbsp;<em>k&nbsp;</em>个排序链表，返回合并后的排序链表。请分析和描述算法的复杂度。</p>

solution/0000-0099/0023.Merge k Sorted Lists/README_EN.md

@@ -1,5 +1,7 @@
 # [23. Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists)
 
+[中文文档](/solution/0000-0099/0023.Merge%20k%20Sorted%20Lists/README.md)
+
 ## Description
 <p>Merge <em>k</em> sorted linked lists and return it as one sorted list. Analyze and describe its complexity.</p>
 

solution/0000-0099/0024.Swap Nodes in Pairs/README.md

@@ -1,5 +1,7 @@
 # [24. 两两交换链表中的节点](https://leetcode-cn.com/problems/swap-nodes-in-pairs)
 
+[English Version](/solution/0000-0099/0024.Swap%20Nodes%20in%20Pairs/README_EN.md)
+
 ## 题目描述
 <!-- 这里写题目描述 -->
 <p>给定一个链表，两两交换其中相邻的节点，并返回交换后的链表。</p>

solution/0000-0099/0024.Swap Nodes in Pairs/README_EN.md

@@ -1,5 +1,7 @@
 # [24. Swap Nodes in Pairs](https://leetcode.com/problems/swap-nodes-in-pairs)
 
+[中文文档](/solution/0000-0099/0024.Swap%20Nodes%20in%20Pairs/README.md)
+
 ## Description
 <p>Given a&nbsp;linked list, swap every two adjacent nodes and return its head.</p>
 

solution/0000-0099/0025.Reverse Nodes in k-Group/README.md

@@ -1,5 +1,7 @@
 # [25. K 个一组翻转链表](https://leetcode-cn.com/problems/reverse-nodes-in-k-group)
 
+[English Version](/solution/0000-0099/0025.Reverse%20Nodes%20in%20k-Group/README_EN.md)
+
 ## 题目描述
 <!-- 这里写题目描述 -->
 <p>给你一个链表，每&nbsp;<em>k&nbsp;</em>个节点一组进行翻转，请你返回翻转后的链表。</p>

solution/0000-0099/0025.Reverse Nodes in k-Group/README_EN.md

@@ -1,5 +1,7 @@
 # [25. Reverse Nodes in k-Group](https://leetcode.com/problems/reverse-nodes-in-k-group)
 
+[中文文档](/solution/0000-0099/0025.Reverse%20Nodes%20in%20k-Group/README.md)
+
 ## Description
 <p>Given a linked list, reverse the nodes of a linked list <em>k</em> at a time and return its modified list.</p>