替换HTML标签

Author: diguage

docs/1341-movie-rating.adoc

@@ -63,7 +63,7 @@ Write a solution to:
 The result format is in the following example.
 
 
-<strong class="example">Example 1:*
+*Example 1:*
 
 [subs="verbatim,quotes"]
 ----

docs/1342-number-of-steps-to-reduce-a-number-to-zero.adoc

@@ -8,7 +8,7 @@ Given an integer `num`, return _the number of steps to reduce it to zero_.
 In one step, if the current number is even, you have to divide it by `2`, otherwise, you have to subtract `1` from it.
 
 
-<strong class="example">Example 1:*
+*Example 1:*
 
 [subs="verbatim,quotes"]
 ----
@@ -23,7 +23,7 @@ Step 5) 2 is even; divide by 2 and obtain 1.
 Step 6) 1 is odd; subtract 1 and obtain 0.
 ----
 
-<strong class="example">Example 2:*
+*Example 2:*
 
 [subs="verbatim,quotes"]
 ----
@@ -36,7 +36,7 @@ Step 3) 2 is even; divide by 2 and obtain 1.
 Step 4) 1 is odd; subtract 1 and obtain 0.
 ----
 
-<strong class="example">Example 3:*
+*Example 3:*
 
 [subs="verbatim,quotes"]
 ----

docs/1343-number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold.adoc

@@ -6,7 +6,7 @@
 Given an array of integers `arr` and two integers `k` and `threshold`, return _the number of sub-arrays of size _`k`_ and average greater than or equal to _`threshold`.
 
  
-<strong class="example">Example 1:*
+*Example 1:*
 
 [subs="verbatim,quotes"]
 ----
@@ -15,7 +15,7 @@ Given an array of integers `arr` and two integers `k` and `threshold`, return _t
 *Explanation:* Sub-arrays [2,5,5],[5,5,5] and [5,5,8] have averages 4, 5 and 6 respectively. All other sub-arrays of size 3 have averages less than 4 (the threshold).
 ----
 
-<strong class="example">Example 2:*
+*Example 2:*
 
 [subs="verbatim,quotes"]
 ----

docs/1344-angle-between-hands-of-a-clock.adoc

@@ -8,23 +8,23 @@ Given two numbers, `hour` and `minutes`, return _the smaller angle (in degrees)
 Answers within `10^-5^` of the actual value will be accepted as correct.
 
 
-<strong class="example">Example 1:*
+*Example 1:*
 <img alt="" src="https://assets.leetcode.com/uploads/2019/12/26/sample_1_1673.png" style="width: 300px; height: 296px;" />
 [subs="verbatim,quotes"]
 ----
 *Input:* hour = 12, minutes = 30
 *Output:* 165
 ----
 
-<strong class="example">Example 2:*
+*Example 2:*
 <img alt="" src="https://assets.leetcode.com/uploads/2019/12/26/sample_2_1673.png" style="width: 300px; height: 301px;" />
 [subs="verbatim,quotes"]
 ----
 *Input:* hour = 3, minutes = 30
 *Output:* 75
 ----
 
-<strong class="example">Example 3:*
+*Example 3:*
 <img alt="" src="https://assets.leetcode.com/uploads/2019/12/26/sample_3_1673.png" style="width: 300px; height: 301px;" />
 [subs="verbatim,quotes"]
 ----

docs/1345-jump-game-iv.adoc

@@ -18,7 +18,7 @@ Return _the minimum number of steps_ to reach the *last index* of the array.
 Notice that you can not jump outside of the array at any time.
 
 
-<strong class="example">Example 1:*
+*Example 1:*
 
 [subs="verbatim,quotes"]
 ----
@@ -27,7 +27,7 @@ Notice that you can not jump outside of the array at any time.
 *Explanation:* You need three jumps from index 0 --> 4 --> 3 --> 9. Note that index 9 is the last index of the array.
 ----
 
-<strong class="example">Example 2:*
+*Example 2:*
 
 [subs="verbatim,quotes"]
 ----
@@ -36,7 +36,7 @@ Notice that you can not jump outside of the array at any time.
 *Explanation:* Start index is the last index. You do not need to jump.
 ----
 
-<strong class="example">Example 3:*
+*Example 3:*
 
 [subs="verbatim,quotes"]
 ----

docs/1346-check-if-n-and-its-double-exist.adoc

@@ -12,7 +12,7 @@ Given an array `arr` of integers, check if there exist two indices `i` and `j` s
 
 
  
-<strong class="example">Example 1:*
+*Example 1:*
 
 [subs="verbatim,quotes"]
 ----
@@ -21,7 +21,7 @@ Given an array `arr` of integers, check if there exist two indices `i` and `j` s
 *Explanation:* For i = 0 and j = 2, arr[i] == 10 == 2 * 5 == 2 * arr[j]
 ----
 
-<strong class="example">Example 2:*
+*Example 2:*
 
 [subs="verbatim,quotes"]
 ----

docs/1347-minimum-number-of-steps-to-make-two-strings-anagram.adoc

@@ -10,7 +10,7 @@ Return _the minimum number of steps_ to make `t` an anagram of `s`.
 An *Anagram* of a string is a string that contains the same characters with a different (or the same) ordering.
 
 
-<strong class="example">Example 1:*
+*Example 1:*
 
 [subs="verbatim,quotes"]
 ----
@@ -19,7 +19,7 @@ An *Anagram* of a string is a string that contains the same characters with a di
 *Explanation:* Replace the first 'a' in t with b, t = "bba" which is anagram of s.
 ----
 
-<strong class="example">Example 2:*
+*Example 2:*
 
 [subs="verbatim,quotes"]
 ----
@@ -28,7 +28,7 @@ An *Anagram* of a string is a string that contains the same characters with a di
 *Explanation:* Replace 'p', 'r', 'a', 'i' and 'c' from t with proper characters to make t anagram of s.
 ----
 
-<strong class="example">Example 3:*
+*Example 3:*
 
 [subs="verbatim,quotes"]
 ----

docs/1348-tweet-counts-per-frequency.adoc

@@ -30,7 +30,7 @@ Implement the `TweetCounts` class:
 
 
  
-<strong class="example">Example:*
+*Example:*
 
 [subs="verbatim,quotes"]
 ----

docs/1349-maximum-students-taking-exam.adoc

@@ -10,7 +10,7 @@ Students can see the answers of those sitting next to the left, right, upper lef
 Students must be placed in seats in good condition.
 
  
-<strong class="example">Example 1:*
+*Example 1:*
 <img height="200" src="https://assets.leetcode.com/uploads/2020/01/29/image.png" width="339" />
 [subs="verbatim,quotes"]
 ----
@@ -21,7 +21,7 @@ Students must be placed in seats in good condition.
 *Explanation:* Teacher can place 4 students in available seats so they don't cheat on the exam. 
 ----
 
-<strong class="example">Example 2:*
+*Example 2:*
 
 [subs="verbatim,quotes"]
 ----
@@ -35,7 +35,7 @@ Students must be placed in seats in good condition.
 
 ----
 
-<strong class="example">Example 3:*
+*Example 3:*
 
 [subs="verbatim,quotes"]
 ----

docs/1351-count-negative-numbers-in-a-sorted-matrix.adoc

@@ -6,7 +6,7 @@
 Given a `m x n` matrix `grid` which is sorted in non-increasing order both row-wise and column-wise, return _the number of *negative* numbers in_ `grid`.
 
 
-<strong class="example">Example 1:*
+*Example 1:*
 
 [subs="verbatim,quotes"]
 ----
@@ -15,7 +15,7 @@ Given a `m x n` matrix `grid` which is sorted in non-increasing order both row-w
 *Explanation:* There are 8 negatives number in the matrix.
 ----
 
-<strong class="example">Example 2:*
+*Example 2:*
 
 [subs="verbatim,quotes"]
 ----

docs/1352-product-of-the-last-k-numbers.adoc

@@ -16,7 +16,7 @@ Implement the `ProductOfNumbers` class:
 The test cases are generated so that, at any time, the product of any contiguous sequence of numbers will fit into a single 32-bit integer without overflowing.
 
 
-<strong class="example">Example:*
+*Example:*
 
 [subs="verbatim,quotes"]
 ----

docs/1353-maximum-number-of-events-that-can-be-attended.adoc

@@ -10,7 +10,7 @@ You can attend an event `i` at any day `d` where `startTime<sub>i</sub> <= d <=
 Return _the maximum number of events you can attend_.
 
 
-<strong class="example">Example 1:*
+*Example 1:*
 <img alt="" src="https://assets.leetcode.com/uploads/2020/02/05/e1.png" style="width: 400px; height: 267px;" />
 [subs="verbatim,quotes"]
 ----
@@ -23,7 +23,7 @@ Attend the second event on day 2.
 Attend the third event on day 3.
 ----
 
-<strong class="example">Example 2:*
+*Example 2:*
 
 [subs="verbatim,quotes"]
 ----

docs/1354-construct-target-array-with-multiple-sums.adoc

@@ -14,7 +14,7 @@ You are given an array `target` of n integers. From a starting array `arr` consi
 Return `true` _if it is possible to construct the_ `target` _array from_ `arr`_, otherwise, return_ `false`.
 
 
-<strong class="example">Example 1:*
+*Example 1:*
 
 [subs="verbatim,quotes"]
 ----
@@ -27,7 +27,7 @@ Return `true` _if it is possible to construct the_ `target` _array from_ `arr`_,
 [9, 3, 5] Done
 ----
 
-<strong class="example">Example 2:*
+*Example 2:*
 
 [subs="verbatim,quotes"]
 ----
@@ -36,7 +36,7 @@ Return `true` _if it is possible to construct the_ `target` _array from_ `arr`_,
 *Explanation:* Impossible to create target array from [1,1,1,1].
 ----
 
-<strong class="example">Example 3:*
+*Example 3:*
 
 [subs="verbatim,quotes"]
 ----

docs/1356-sort-integers-by-the-number-of-1-bits.adoc

@@ -8,7 +8,7 @@ You are given an integer array `arr`. Sort the integers in the array in ascendin
 Return _the array after sorting it_.
 
  
-<strong class="example">Example 1:*
+*Example 1:*
 
 [subs="verbatim,quotes"]
 ----
@@ -21,7 +21,7 @@ Return _the array after sorting it_.
 The sorted array by bits is [0,1,2,4,8,3,5,6,7]
 ----
 
-<strong class="example">Example 2:*
+*Example 2:*
 
 [subs="verbatim,quotes"]
 ----

docs/1357-apply-discount-every-n-orders.adoc

@@ -17,7 +17,7 @@ Implement the `Cashier` class:
 
 
  
-<strong class="example">Example 1:*
+*Example 1:*
 
 [subs="verbatim,quotes"]
 ----

docs/1358-number-of-substrings-containing-all-three-characters.adoc

@@ -8,7 +8,7 @@ Given a string `s` consisting only of characters _a_, _b_ and _c_.
 Return the number of substrings containing *at least* one occurrence of all these characters _a_, _b_ and _c_.
 
 
-<strong class="example">Example 1:*
+*Example 1:*
 
 [subs="verbatim,quotes"]
 ----
@@ -17,7 +17,7 @@ Return the number of substrings containing *at least* one occurrence of all thes
 *Explanation:* The substrings containing at least one occurrence of the characters _a_, _b_ and _c are "_abc_", "_abca_", "_abcab_", "_abcabc_", "_bca_", "_bcab_", "_bcabc_", "_cab_", "_cabc_" _and_ "_abc_" _(*again*)_. _
 ----
 
-<strong class="example">Example 2:*
+*Example 2:*
 
 [subs="verbatim,quotes"]
 ----
@@ -26,7 +26,7 @@ Return the number of substrings containing *at least* one occurrence of all thes
 *Explanation:* The substrings containing at least one occurrence of the characters _a_, _b_ and _c are "_aaacb_", "_aacb_" _and_ "_acb_".__ _
 ----
 
-<strong class="example">Example 3:*
+*Example 3:*
 
 [subs="verbatim,quotes"]
 ----

docs/1359-count-all-valid-pickup-and-delivery-options.adoc

@@ -10,7 +10,7 @@ Count all valid pickup/delivery possible sequences such that delivery(i) is alwa
 Since the answer may be too large, return it modulo 10^9 + 7.
 
 
-<strong class="example">Example 1:*
+*Example 1:*
 
 [subs="verbatim,quotes"]
 ----
@@ -19,7 +19,7 @@ Since the answer may be too large, return it modulo 10^9 + 7.
 *Explanation:* Unique order (P1, D1), Delivery 1 always is after of Pickup 1.
 ----
 
-<strong class="example">Example 2:*
+*Example 2:*
 
 [subs="verbatim,quotes"]
 ----
@@ -30,7 +30,7 @@ Since the answer may be too large, return it modulo 10^9 + 7.
 This is an invalid order (P1,D2,P2,D1) because Pickup 2 is after of Delivery 2.
 ----
 
-<strong class="example">Example 3:*
+*Example 3:*
 
 [subs="verbatim,quotes"]
 ----

docs/1360-number-of-days-between-two-dates.adoc

@@ -8,11 +8,11 @@ Write a program to count the number of days between two dates.
 The two dates are given as strings, their format is `YYYY-MM-DD` as shown in the examples.
 
 
-<strong class="example">Example 1:*
+*Example 1:*
 [subs="verbatim,quotes"]
 ----*Input:* date1 = "2019-06-29", date2 = "2019-06-30"
 *Output:* 1
-----<strong class="example">Example 2:*
+----*Example 2:*
 [subs="verbatim,quotes"]
 ----*Input:* date1 = "2020-01-15", date2 = "2019-12-31"
 *Output:* 15

docs/1361-validate-binary-tree-nodes.adoc

@@ -10,23 +10,23 @@ If node `i` has no left child then `leftChild[i]` will equal `-1`, similarly for
 Note that the nodes have no values and that we only use the node numbers in this problem.
 
 
-<strong class="example">Example 1:*
+*Example 1:*
 <img alt="" src="https://assets.leetcode.com/uploads/2019/08/23/1503_ex1.png" style="width: 195px; height: 287px;" />
 [subs="verbatim,quotes"]
 ----
 *Input:* n = 4, leftChild = [1,-1,3,-1], rightChild = [2,-1,-1,-1]
 *Output:* true
 ----
 
-<strong class="example">Example 2:*
+*Example 2:*
 <img alt="" src="https://assets.leetcode.com/uploads/2019/08/23/1503_ex2.png" style="width: 183px; height: 272px;" />
 [subs="verbatim,quotes"]
 ----
 *Input:* n = 4, leftChild = [1,-1,3,-1], rightChild = [2,3,-1,-1]
 *Output:* false
 ----
 
-<strong class="example">Example 3:*
+*Example 3:*
 <img alt="" src="https://assets.leetcode.com/uploads/2019/08/23/1503_ex3.png" style="width: 82px; height: 174px;" />
 [subs="verbatim,quotes"]
 ----