remove useless tags and format the document

Author: diguage

docs/0003-longest-substring-without-repeating-characters.adoc

@@ -8,8 +8,8 @@ Given a string, find the length of the *longest substring* without repeating cha
 .Example 1:
 [subs="verbatim,quotes"]
 ----
-*Input: * "abcabcbb"
-*Output: * 3 
+*Input:* "abcabcbb"
+*Output:* 3 
 *Explanation:* The answer is `"abc"`, with the length of 3. 
 ----
 

docs/0014-longest-common-prefix.adoc

@@ -10,15 +10,15 @@ If there is no common prefix, return an empty string `""`.
 
 [subs="verbatim,quotes"]
 ----
-*Input: *["flower","flow","flight"]
+*Input:* ["flower","flow","flight"]
 *Output:* "fl"
 ----
 
 *Example 2:*
 
 [subs="verbatim,quotes"]
 ----
-*Input: *["dog","racecar","car"]
+*Input:* ["dog","racecar","car"]
 *Output:* ""
 *Explanation:* There is no common prefix among the input strings.
 ----

docs/0017-letter-combinations-of-a-phone-number.adoc

@@ -12,7 +12,7 @@ image::http://upload.wikimedia.org/wikipedia/commons/thumb/7/73/Telephone-keypad
 
 [subs="verbatim,quotes"]
 ----
-*Input: *"23"
+*Input:* "23"
 *Output:* ["ad", "ae", "af", "bd", "be", "bf", "cd", "ce", "cf"].
 ----
 

docs/0071-simplify-path.adoc

@@ -69,50 +69,50 @@ Note that the returned canonical path must always begin with a slash `/`, and th
 
 [subs="verbatim,quotes"]
 ----
-*Input: "*<span id="example-input-1-1">/home/"
-*Output: "*<span id="example-output-1">/home"
+*Input:* "/home/"
+*Output:* "/home"
 *Explanation:* Note that there is no trailing slash after the last directory name.
 ----
 
 *Example 2:*
 
 [subs="verbatim,quotes"]
 ----
-*Input: "*<span id="example-input-1-1">/../"
-*Output: "*<span id="example-output-1">/"
+*Input:* "/../"
+*Output:* "/"
 *Explanation:* Going one level up from the root directory is a no-op, as the root level is the highest level you can go.
 ----
 
 *Example 3:*
 
 [subs="verbatim,quotes"]
 ----
-*Input: "*<span id="example-input-1-1">/home//foo/"
-*Output: "*<span id="example-output-1">/home/foo"
-*Explanation: *In the canonical path, multiple consecutive slashes are replaced by a single one.
+*Input:* "/home//foo/"
+*Output:* "/home/foo"
+*Explanation:* In the canonical path, multiple consecutive slashes are replaced by a single one.
 ----
 
 *Example 4:*
 
 [subs="verbatim,quotes"]
 ----
-*Input: "*<span id="example-input-1-1">/a/./b/../../c/"
-*Output: "*<span id="example-output-1">/c"
+*Input:* "/a/./b/../../c/"
+*Output:* "/c"
 ----
 
 *Example 5:*
 
 [subs="verbatim,quotes"]
 ----
-*Input: "*<span id="example-input-1-1">/a/../../b/../c//.//"
-*Output: "*<span id="example-output-1">/c"
+*Input:* "/a/../../b/../c//.//"
+*Output:* "/c"
 ----
 
 *Example 6:*
 
 [subs="verbatim,quotes"]
 ----
-*Input: "*<span id="example-input-1-1">/a//b////c/d//././/.."
-*Output: "*<span id="example-output-1">/a/b/c"
+*Input:* "/a//b////c/d//././/.."
+*Output:* "/a/b/c"
 ----
 

docs/0115-distinct-subsequences.adoc

@@ -10,10 +10,9 @@ A subsequence of a string is a new string which is formed from the original stri
 
 [subs="verbatim,quotes"]
 ----
-*Input: *S = `"rabbbit"`, T = `"rabbit"
+*Input:* S = `"rabbbit"`, T = `"rabbit"`
 *Output:* 3
-`*Explanation:
-*
+*Explanation:*
 As shown below, there are 3 ways you can generate "rabbit" from S.
 (The caret symbol ^ means the chosen letters)
 
@@ -29,10 +28,9 @@ As shown below, there are 3 ways you can generate "rabbit" from S.
 
 [subs="verbatim,quotes"]
 ----
-*Input: *S = `"babgbag"`, T = `"bag"
+*Input:* S = `"babgbag"`, T = `"bag"`
 *Output:* 5
-`*Explanation:
-*
+*Explanation:*
 As shown below, there are 5 ways you can generate "bag" from S.
 (The caret symbol ^ means the chosen letters)
 

docs/0126-word-ladder-ii.adoc

@@ -44,7 +44,7 @@ beginWord = "hit"
 endWord = "cog"
 wordList = ["hot","dot","dog","lot","log"]
 
-*Output: *[]
+*Output:* []
 
 *Explanation:* The endWord "cog" is not in wordList, therefore no possible* *transformation.
 ----

docs/0127-word-ladder.adoc

@@ -35,7 +35,7 @@ beginWord = "hit",
 endWord = "cog",
 wordList = ["hot","dot","dog","lot","log","cog"]
 
-*Output: *5
+*Output:* 5
 
 *Explanation:* As one shortest transformation is "hit" -> "hot" -> "dot" -> "dog" -> "cog",
 return its length 5.

docs/0141-linked-list-cycle.adoc

@@ -15,8 +15,8 @@ To represent a cycle in the given linked list, we use an integer `pos` which rep
 
 [subs="verbatim,quotes"]
 ----
-*Input: *head = <span id="example-input-1-1">[3,2,0,-4], pos = <span id="example-input-1-2">1
-*Output: *<span id="example-output-1">true
+*Input:* head = [3,2,0,-4], pos = 1
+*Output:* true
 *Explanation:* There is a cycle in the linked list, where tail connects to the second node.
 ----
 
@@ -28,8 +28,8 @@ image::https://assets.leetcode.com/uploads/2018/12/07/circularlinkedlist.png[]
 
 [subs="verbatim,quotes"]
 ----
-*Input: *head = <span id="example-input-1-1">[1,2], pos = <span id="example-input-1-2">0
-*Output: *<span id="example-output-1">true
+*Input:* head = [1,2], pos = 0
+*Output:* true
 *Explanation:* There is a cycle in the linked list, where tail connects to the first node.
 ----
 
@@ -41,8 +41,8 @@ image::https://assets.leetcode.com/uploads/2018/12/07/circularlinkedlist_test2.p
 
 [subs="verbatim,quotes"]
 ----
-*Input: *head = <span id="example-input-1-1">[1], pos = <span id="example-input-1-2">-1
-*Output: *<span id="example-output-1">false
+*Input:* head = [1], pos = -1
+*Output:* false
 *Explanation:* There is no cycle in the linked list.
 ----
 

docs/0142-linked-list-cycle-ii.adoc

@@ -86,8 +86,8 @@ To represent a cycle in the given linked list, we use an integer `pos` which rep
 
 [subs="verbatim,quotes"]
 ----
-*Input: *head = [3,2,0,-4], pos = 1
-*Output: *tail connects to node index 1
+*Input:* head = [3,2,0,-4], pos = 1
+*Output:* tail connects to node index 1
 *Explanation:* There is a cycle in the linked list, where tail connects to the second node.
 ----
 
@@ -97,8 +97,8 @@ image::https://assets.leetcode.com/uploads/2018/12/07/circularlinkedlist.png[]
 
 [subs="verbatim,quotes"]
 ----
-*Input: *head = [1,2], pos = 0
-*Output: *tail connects to node index 0
+*Input:* head = [1,2], pos = 0
+*Output:* tail connects to node index 0
 *Explanation:* There is a cycle in the linked list, where tail connects to the first node.
 ----
 
@@ -108,8 +108,8 @@ image::https://assets.leetcode.com/uploads/2018/12/07/circularlinkedlist_test2.p
 
 [subs="verbatim,quotes"]
 ----
-*Input: *head = [1], pos = -1
-*Output: *no cycle
+*Input:* head = [1], pos = -1
+*Output:* no cycle
 *Explanation:* There is no cycle in the linked list.
 ----
 

docs/0151-reverse-words-in-a-string.adoc

@@ -11,15 +11,15 @@ Given an input string, reverse the string word by word.
 [subs="verbatim,quotes"]
 ----
 *Input:* "`the sky is blue`"
-*Output: *"`blue is sky the`"
+*Output:* "`blue is sky the`"
 ----
 
 *Example 2:*
 
 [subs="verbatim,quotes"]
 ----
 *Input:* "  hello world!  "
-*Output: *"world! hello"
+*Output:* "world! hello"
 *Explanation:* Your reversed string should not contain leading or trailing spaces.
 ----
 
@@ -28,7 +28,7 @@ Given an input string, reverse the string word by word.
 [subs="verbatim,quotes"]
 ----
 *Input:* "a good   example"
-*Output: *"example good a"
+*Output:* "example good a"
 *Explanation:* You need to reduce multiple spaces between two words to a single space in the reversed string.
 ----
 

docs/0160-intersection-of-two-linked-lists.adoc

@@ -28,7 +28,7 @@ image::https://assets.leetcode.com/uploads/2018/12/13/160_example_1.png[]
 
 [subs="verbatim,quotes"]
 ----
-*Input: *intersectVal = 8, listA = [4,1,8,4,5], listB = [5,0,1,8,4,5], skipA = 2, skipB = 3
+*Input:* intersectVal = 8, listA = [4,1,8,4,5], listB = [5,0,1,8,4,5], skipA = 2, skipB = 3
 *Output:* Reference of the node with value = 8
 *Input Explanation:* The intersected node's value is 8 (note that this must not be 0 if the two lists intersect). From the head of A, it reads as [4,1,8,4,5]. From the head of B, it reads as [5,0,1,8,4,5]. There are 2 nodes before the intersected node in A; There are 3 nodes before the intersected node in B.
 ----
@@ -41,7 +41,7 @@ image::https://assets.leetcode.com/uploads/2018/12/13/160_example_2.png[]
 
 [subs="verbatim,quotes"]
 ----
-*Input: *intersectVal = 2, listA = [0,9,1,2,4], listB = [3,2,4], skipA = 3, skipB = 1
+*Input:* intersectVal = 2, listA = [0,9,1,2,4], listB = [3,2,4], skipA = 3, skipB = 1
 *Output:* Reference of the node with value = 2
 *Input Explanation:* The intersected node's value is 2 (note that this must not be 0 if the two lists intersect). From the head of A, it reads as [0,9,1,2,4]. From the head of B, it reads as [3,2,4]. There are 3 nodes before the intersected node in A; There are 1 node before the intersected node in B.
 
@@ -55,7 +55,7 @@ image::https://assets.leetcode.com/uploads/2018/12/13/160_example_3.png[]
 
 [subs="verbatim,quotes"]
 ----
-*Input: *intersectVal = 0, listA = [2,6,4], listB = [1,5], skipA = 3, skipB = 2
+*Input:* intersectVal = 0, listA = [2,6,4], listB = [1,5], skipA = 3, skipB = 2
 *Output:* null
 *Input Explanation:* From the head of A, it reads as [2,6,4]. From the head of B, it reads as [1,5]. Since the two lists do not intersect, intersectVal must be 0, while skipA and skipB can be arbitrary values.
 *Explanation:* The two lists do not intersect, so return null.

docs/0165-compare-version-numbers.adoc

@@ -24,7 +24,7 @@ You may assume the default revision number for each level of a version number to
 *Example 2:*
 [subs="verbatim,quotes"]
 ----
-*Input: *`_version1_` = "1.0.1", `_version2_` = "1"
+*Input:* `_version1_` = "1.0.1", `_version2_` = "1"
 *Output:* 1
 ----
 

docs/0166-fraction-to-recurring-decimal.adoc

@@ -29,6 +29,6 @@ If the fractional part is repeating, enclose the repeating part in parentheses.
 [subs="verbatim,quotes"]
 ----
 *Input:* numerator = 2, denominator = 3
-*Output: *"0.(6)"
+*Output:* "0.(6)"
 ----
 

docs/0171-excel-sheet-column-number.adoc

@@ -32,14 +32,14 @@ For example:
 
 [subs="verbatim,quotes"]
 ----
-*Input: *"AB"
+*Input:* "AB"
 *Output:* 28
 ----
 
 *Example 3:*
 
 [subs="verbatim,quotes"]
 ----
-*Input: *"ZY"
+*Input:* "ZY"
 *Output:* 701
 ----

docs/0188-best-time-to-buy-and-sell-stock-iv.adoc

@@ -85,7 +85,7 @@ public int maxProfit(int[] prices) {
 . https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-with-cooldown/solution/yi-ge-fang-fa-tuan-mie-6-dao-gu-piao-wen-ti-by-lab/[一个方法团灭 6 道股票问题 - 最佳买卖股票时机含冷冻期 - 力扣（LeetCode）]
 . https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-with-cooldown/solution/dong-tai-gui-hua-shen-ru-fen-xi-by-wang-yan-19/[动态规划深入分析 - 最佳买卖股票时机含冷冻期 - 力扣（LeetCode）]
 
-Say you have an array for which the _i<span style="font-size: 10.8333px;">-_<span style="font-size: 10.8333px;">th element is the price of a given stock on day _i_.
+Say you have an array for which the _i -_ th element is the price of a given stock on day _i_.
 
 Design an algorithm to find the maximum profit. You may complete at most *k* transactions.
 

docs/0190-reverse-bits.adoc

@@ -14,7 +14,7 @@ Reverse bits of a given 32 bits unsigned integer.
 ----
 *Input:* 00000010100101000001111010011100
 *Output:* 00111001011110000010100101000000
-*Explanation: *The input binary string *00000010100101000001111010011100* represents the unsigned integer 43261596, so return 964176192 which its binary representation is *00111001011110000010100101000000*.
+*Explanation:* The input binary string *00000010100101000001111010011100* represents the unsigned integer 43261596, so return 964176192 which its binary representation is *00111001011110000010100101000000*.
 
 ----
 
@@ -24,7 +24,7 @@ Reverse bits of a given 32 bits unsigned integer.
 ----
 *Input:* 11111111111111111111111111111101
 *Output:* 10111111111111111111111111111111
-*Explanation: *The input binary string *11111111111111111111111111111101* represents the unsigned integer 4294967293, so return 3221225471 which its binary representation is *10111111111111111111111111111111*.
+*Explanation:* The input binary string *11111111111111111111111111111101* represents the unsigned integer 4294967293, so return 3221225471 which its binary representation is *10111111111111111111111111111111*.
 ----
 
 

docs/0191-number-of-1-bits.adoc

@@ -16,7 +16,7 @@ Write a function that takes an unsigned integer and return the number of '1' bit
 ----
 *Input:* 00000000000000000000000000001011
 *Output:* 3
-*Explanation: *The input binary string `*00000000000000000000000000001011* has a total of three '1' bits.`
+*Explanation:* The input binary string `*00000000000000000000000000001011* has a total of three '1' bits.`
 
 ----
 
@@ -26,7 +26,7 @@ Write a function that takes an unsigned integer and return the number of '1' bit
 ----
 *Input:* 00000000000000000000000010000000
 *Output:* 1
-*Explanation: *The input binary string *00000000000000000000000010000000* has a total of one '1' bit.
+*Explanation:* The input binary string *00000000000000000000000010000000* has a total of one '1' bit.
 
 ----
 
@@ -36,7 +36,7 @@ Write a function that takes an unsigned integer and return the number of '1' bit
 ----
 *Input:* 11111111111111111111111111111101
 *Output:* 31
-*Explanation: *The input binary string *11111111111111111111111111111101* has a total of thirty one '1' bits.
+*Explanation:* The input binary string *11111111111111111111111111111101* has a total of thirty one '1' bits.
 ----
 
 

docs/0200-number-of-islands.adoc

@@ -33,5 +33,5 @@ Given a 2d grid map of `'1'`s (land) and `'0'`s (water), count the number of isl
 00100
 00011
 
-*Output: *3
+*Output:* 3
 ----

docs/0207-course-schedule.adoc

@@ -26,7 +26,7 @@ Given the total number of courses and a list of prerequisite *pairs*, is it poss
 [subs="verbatim,quotes"]
 ----
 *Input:* 2, [[1,0]] 
-*Output: *true
+*Output:* true
 *Explanation:* There are a total of 2 courses to take. 
              To take course 1 you should have finished course 0. So it is possible.
 ----
@@ -36,7 +36,7 @@ Given the total number of courses and a list of prerequisite *pairs*, is it poss
 [subs="verbatim,quotes"]
 ----
 *Input:* 2, [[1,0],[0,1]]
-*Output: *false
+*Output:* false
 *Explanation:* There are a total of 2 courses to take. 
              To take course 1 you should have finished course 0, and to take course 0 you should
              also have finished course 1. So it is impossible.

docs/0209-minimum-size-subarray-sum.adoc

@@ -10,7 +10,7 @@ Given an array of *n* positive integers and a positive integer *s*, find the min
 ----
 *Input:* `s = 7, nums = [2,3,1,2,4,3]`
 *Output:* 2
-*Explanation: *the subarray `[4,3]` has the minimal length under the problem constraint.
+*Explanation:* The subarray `[4,3]` has the minimal length under the problem constraint.
 ----
 
 <div class="spoilers">*Follow up:*