remove br tag

Author: diguage

docs/0303-range-sum-query-immutable.adoc

@@ -4,7 +4,7 @@ https://leetcode.com/problems/range-sum-query-immutable/[LeetCode - Range Sum Qu
 
 Given an integer array _nums_, find the sum of the elements between indices _i_ and _j_ (_i_ ≤ _j_), inclusive.
 
-*Example:*<br>
+*Example:*
 [subs="verbatim,quotes,macros"]
 ----
 Given nums = [-2, 0, 3, -5, 2, -1]
@@ -15,7 +15,7 @@ sumRange(0, 5) -> -3
 ----
 
 
-*Note:*<br>
+*Note:*
 
 . You may assume that the array does not change.
 . There are many calls to _sumRange_ function.

docs/0304-range-sum-query-2d-immutable.adoc

@@ -11,7 +11,7 @@ image::https://leetcode.com/static/images/courses/range_sum_query_2d.png[]
 [.small]#The above rectangle (with the red border) is defined by (row1, col1) = *(2, 1)* and (row2, col2) = *(4, 3)*, which contains sum = *8*.#
 
 
-*Example:*<br>
+*Example:*
 [subs="verbatim,quotes,macros"]
 ----
 Given matrix = [
@@ -28,7 +28,7 @@ sumRegion(1, 2, 2, 4) -> 12
 ----
 
 
-*Note:*<br>
+*Note:*
 
 . You may assume that the matrix does not change.
 . There are many calls to _sumRegion_ function.

docs/0378-kth-smallest-element-in-a-sorted-matrix.adoc

@@ -24,5 +24,5 @@ return 13.
 ----
 
 
-*Note: *<br>
+*Note: *
 You may assume k is always valid, 1 ≤ k ≤ n^2^.

docs/0401-binary-watch.adoc

@@ -14,7 +14,8 @@ Given a non-negative integer _n_ which represents the number of LEDs that are cu
 *Example:*
 [subs="verbatim,quotes,macros"]
 ----
-Input: n = 1<br>Return: ["1:00", "2:00", "4:00", "8:00", "0:01", "0:02", "0:04", "0:08", "0:16", "0:32"]
+Input: n = 1
+Return: ["1:00", "2:00", "4:00", "8:00", "0:01", "0:02", "0:04", "0:08", "0:16", "0:32"]
 ----
 
 

docs/0419-battleships-in-a-board.adoc

@@ -32,4 +32,6 @@ XXXX
 ----
 This is an invalid board that you will not receive - as battleships will always have a cell separating between them.
 
-*Follow up:*<br>Could you do it in *one-pass*, using only *O(1) extra memory* and *without modifying* the value of the board?
+*Follow up:*
+
+Could you do it in *one-pass*, using only *O(1) extra memory* and *without modifying* the value of the board?

docs/0472-concatenated-words.adoc

@@ -14,11 +14,13 @@ A concatenated word is defined as a string that is comprised entirely of at leas
 
 *Output:* ["catsdogcats","dogcatsdog","ratcatdogcat"]
 
-*Explanation:* "catsdogcats" can be concatenated by "cats", "dog" and "cats"; <br> "dogcatsdog" can be concatenated by "dog", "cats" and "dog"; <br>"ratcatdogcat" can be concatenated by "rat", "cat", "dog" and "cat".
+*Explanation:* "catsdogcats" can be concatenated by "cats", "dog" and "cats";
+               "dogcatsdog" can be concatenated by "dog", "cats" and "dog";
+               "ratcatdogcat" can be concatenated by "rat", "cat", "dog" and "cat".
 ----
 
 
-*Note:*<br>
+*Note:*
 
 . The number of elements of the given array will not exceed `10,000 `
 . The length sum of elements in the given array will not exceed `600,000`. 

docs/0473-matchsticks-to-square.adoc

@@ -30,7 +30,7 @@ Remember the story of Little Match Girl? By now, you know exactly what matchstic
 ----
 
 
-*Note:*<br>
+*Note:*
 
 . The length sum of the given matchsticks is in the range of `0` to `10^9`.
 . The length of the given matchstick array will not exceed `15`.

docs/0476-number-complement.adoc

@@ -4,7 +4,7 @@ https://leetcode.com/problems/number-complement/[LeetCode - Number Complement]
 
 Given a positive integer, output its complement number. The complement strategy is to flip the bits of its binary representation.
 
-*Note:*<br>
+*Note:*
 
 . The given integer is guaranteed to fit within the range of a 32-bit signed integer.
 . You could assume no leading zero bit in the integer’s binary representation.

docs/0477-total-hamming-distance.adoc

@@ -22,7 +22,7 @@ HammingDistance(4, 14) + HammingDistance(4, 2) + HammingDistance(14, 2) = 2 + 2
 ----
 
 
-*Note:*<br>
+*Note:*
 
 . Elements of the given array are in the range of `0 ` to `10^9`
 . Length of the array will not exceed `10^4`. 

docs/0482-license-key-formatting.adoc

@@ -36,7 +36,7 @@ Note that the two extra dashes are not needed and can be removed.
 ----
 
 
-*Note:*<br>
+*Note:*
 
 . The length of string S will not exceed 12,000, and K is a positive integer.
 . String S consists only of alphanumerical characters (a-z and/or A-Z and/or 0-9) and dashes(-).

docs/0486-predict-the-winner.adoc

@@ -30,7 +30,7 @@ Finally, player 1 has more score (234) than player 2 (12), so you need to return
 ----
 
 
-*Note:*<br>
+*Note:*
 
 . 1 <= length of the array <= 20. 
 . Any scores in the given array are non-negative integers and will not exceed 10,000,000.

docs/0492-construct-the-rectangle.adoc

@@ -3,12 +3,15 @@
 https://leetcode.com/problems/construct-the-rectangle/[LeetCode - Construct the Rectangle]
 
 
-For a web developer, it is very important to know how to design a web page's size. So, given a specific rectangular web page’s area, your job by now is to design a rectangular web page, whose length L and width W satisfy the following requirements:[subs="verbatim,quotes,macros"]
+For a web developer, it is very important to know how to design a web page's size. So, given a specific rectangular web page’s area, your job by now is to design a rectangular web page, whose length L and width W satisfy the following requirements:
+
+[subs="verbatim,quotes,macros"]
 ----
 1. The area of the rectangular web page you designed must equal to the given target area.
-<br>2. The width W should not be larger than the length L, which means L >= W.
-<br>3. The difference between length L and width W should be as small as possible.
+2. The width W should not be larger than the length L, which means L >= W.
+3. The difference between length L and width W should be as small as possible.
 ----
+
 You need to output the length L and the width W of the web page you designed in sequence.
 
 
@@ -25,7 +28,7 @@ But according to requirement 2, [1,4] is illegal; according to requirement 3,  [
 ----
 
 
-*Note:*<br>
+*Note:*
 
 . The given area won't exceed 10,000,000 and is a positive integer
 . The web page's width and length you designed must be positive integers.

docs/0493-reverse-pairs.adoc

@@ -20,7 +20,7 @@ You need to return the number of important reverse pairs in the given array.
 *Output*: 3
 ----
 
-*Note:*<br>
+*Note:*
 
 . The length of the given array will not exceed `50,000`.
 . All the numbers in the input array are in the range of 32-bit integer.

docs/0494-target-sum.adoc

@@ -68,7 +68,7 @@ There are 5 ways to assign symbols to make the sum of nums be target 3.
 ----
 
 
-*Note:*<br>
+*Note:*
 
 . The length of the given array is positive and will not exceed 20. 
 . The sum of elements in the given array will not exceed 1000.

docs/0496-next-greater-element-i.adoc

@@ -38,7 +38,7 @@ The Next Greater Number of a number *x* in `nums1` is the first greater number t
 
 
 
-*Note:*<br>
+*Note:*
 
 . All elements in `nums1` and `nums2` are unique.
 . The length of both `nums1` and `nums2` would not exceed 1000.

docs/0502-ipo.adoc

@@ -31,7 +31,7 @@ To sum up, pick a list of at most *k* distinct projects from given projects to m
 ----
 
 
-*Note:*<br>
+*Note:*
 
 . You may assume all numbers in the input are non-negative integers.
 . The length of Profits array and Capital array will not exceed 50,000.

docs/0506-relative-ranks.adoc

@@ -16,7 +16,7 @@ Given scores of *N* athletes, find their relative ranks and the people with the
 ----
 
 
-*Note:*<br>
+*Note:*
 
 . N is a positive integer and won't exceed 10,000.
 . All the scores of athletes are guaranteed to be unique.

docs/0508-most-frequent-subtree-sum.adoc

@@ -6,7 +6,7 @@ https://leetcode.com/problems/most-frequent-subtree-sum/[LeetCode - Most Frequen
 Given the root of a tree, you are asked to find the most frequent subtree sum. The subtree sum of a node is defined as the sum of all the node values formed by the subtree rooted at that node (including the node itself). So what is the most frequent subtree sum value? If there is a tie, return all the values with the highest frequency in any order.
 
 
-*Examples 1*<br>
+*Examples 1*
 Input:
 [subs="verbatim,quotes,macros"]
 ----
@@ -17,7 +17,7 @@ Input:
 return [2, -3, 4], since all the values happen only once, return all of them in any order.
 
 
-*Examples 2*<br>
+*Examples 2*
 Input:
 [subs="verbatim,quotes,macros"]
 ----

docs/0513-find-bottom-left-tree-value.adoc

@@ -22,7 +22,8 @@ Output:
 ----
 
 
- * Example 2: *<br>
+*Example 2:*
+
 [subs="verbatim,quotes,macros"]
 ----
 Input:

docs/0516-longest-palindromic-subsequence.adoc

@@ -6,7 +6,7 @@ https://leetcode.com/problems/longest-palindromic-subsequence/[LeetCode - Longes
 Given a string s, find the longest palindromic subsequence's length in s. You may assume that the maximum length of s is 1000.
 
 
-*Example 1:*<br>
+*Example 1:*
 Input: 
 [subs="verbatim,quotes,macros"]
 ----
@@ -20,7 +20,7 @@ Output:
 One possible longest palindromic subsequence is "bbbb".
 
 
-*Example 2:*<br>
+*Example 2:*
 Input:
 [subs="verbatim,quotes,macros"]
 ----

docs/0517-super-washing-machines.adoc

@@ -47,7 +47,7 @@ It's impossible to make all the three washing machines have the same number of d
 
 
 
-*Note:*<br>
+*Note:*
 
 . The range of n is [1, 10000].
 . The range of dresses number in a super washing machine is [0, 1e5].

docs/0524-longest-word-in-dictionary-through-deleting.adoc

@@ -5,7 +5,7 @@ https://leetcode.com/problems/longest-word-in-dictionary-through-deleting/[LeetC
 
 Given a string and a string dictionary, find the longest string in the dictionary that can be formed by deleting some characters of the given string. If there are more than one possible results, return the longest word with the smallest lexicographical order. If there is no possible result, return the empty string.
 
-*Example 1:*<br>
+*Example 1:*
 [subs="verbatim,quotes,macros"]
 ----
 *Input:*
@@ -17,7 +17,7 @@ s = "abpcplea", d = ["ale","apple","monkey","plea"]
 
 
 
-*Example 2:*<br>
+*Example 2:*
 [subs="verbatim,quotes,macros"]
 ----
 *Input:*
@@ -28,7 +28,7 @@ s = "abpcplea", d = ["a","b","c"]
 ----
 
 
-*Note:*<br>
+*Note:*
 
 . All the strings in the input will only contain lower-case letters.
 . The size of the dictionary won't exceed 1,000.

docs/0539-minimum-time-difference.adoc

@@ -14,7 +14,7 @@ Given a list of 24-hour clock time points in "Hour:Minutes" format, find the min
 ----
 
 
-*Note:*<br>
+*Note:*
 
 . The number of time points in the given list is at least 2 and won't exceed 20000.
 . The input time is legal and ranges from 00:00 to 23:59.

docs/0546-remove-boxes.adoc

@@ -11,7 +11,7 @@ You may experience several rounds to remove boxes until there is no box left. Ea
 Find the maximum points you can get.
 
 
-*Example 1:*<br>
+*Example 1:*
 Input: 
 [subs="verbatim,quotes,macros"]
 ----

docs/0547-friend-circles.adoc

@@ -39,7 +39,7 @@ Given a *N*N* matrix *M* representing the friend relationship between students i
 
 
 
-*Note:*<br>
+*Note:*
 
 . N is in range [1,200].
 . M[i][i] = 1 for all students.

docs/0561-array-partition-i.adoc

@@ -18,7 +18,7 @@ Given an array of *2n* integers, your task is to group these integers into *n* p
 ----
 
 
-*Note:*<br>
+*Note:*
 
 . *n* is a positive integer, which is in the range of [1, 10000].
 . All the integers in the array will be in the range of [-10000, 10000].

docs/0564-find-the-closest-palindrome.adoc

@@ -16,7 +16,7 @@ The 'closest' is defined as absolute difference minimized between two integers.
 ----
 
 
-*Note:*<br>
+*Note:*
 
 . The input *n* is a positive integer represented by string, whose length will not exceed 18.
 . If there is a tie, return the smaller one as answer.

docs/0566-reshape-the-matrix.adoc

@@ -27,7 +27,8 @@ nums =
 r = 1, c = 4
 *Output:* 
 [[1,2,3,4]]
-*Explanation:*<br>The *row-traversing* of nums is [1,2,3,4]. The new reshaped matrix is a 1 * 4 matrix, fill it row by row by using the previous list.
+*Explanation:*
+The *row-traversing* of nums is [1,2,3,4]. The new reshaped matrix is a 1 * 4 matrix, fill it row by row by using the previous list.
 ----
 
 
@@ -44,11 +45,12 @@ r = 2, c = 4
 *Output:* 
 [[1,2],
  [3,4]]
-*Explanation:*<br>There is no way to reshape a 2 * 2 matrix to a 2 * 4 matrix. So output the original matrix.
+*Explanation:*
+There is no way to reshape a 2 * 2 matrix to a 2 * 4 matrix. So output the original matrix.
 ----
 
 
-*Note:*<br>
+*Note:*
 
 . The height and width of the given matrix is in range [1, 100].
 . The given r and c are all positive.

docs/0572-subtree-of-another-tree.adoc

@@ -6,7 +6,7 @@ https://leetcode.com/problems/subtree-of-another-tree/[LeetCode - Subtree of Ano
 Given two non-empty binary trees *s* and *t*, check whether tree *t* has exactly the same structure and node values with a subtree of *s*. A subtree of *s* is a tree consists of a node in *s* and all of this node's descendants. The tree *s* could also be considered as a subtree of itself.
 
 
-*Example 1:*<br>
+*Example 1:*
 
 Given tree s:
 [subs="verbatim,quotes,macros"]
@@ -27,7 +27,7 @@ Given tree t:
 Return *true*, because t has the same structure and node values with a subtree of s.
 
 
-*Example 2:*<br>
+*Example 2:*
 
 Given tree s:
 [subs="verbatim,quotes,macros"]

docs/0581-shortest-unsorted-continuous-subarray.adoc

@@ -47,7 +47,7 @@ You need to find the *shortest* such subarray and output its length.
 ----
 
 
-*Note:*<br>
+*Note:*
 
 . Then length of the input array is in range [1, 10,000].
 . The input array may contain duplicates, so ascending order here means *<=*. 

docs/0583-delete-operation-for-two-strings.adoc

@@ -17,7 +17,7 @@ Given two words _word1_ and _word2_, find the minimum number of steps required t
 ----
 
 
-*Note:*<br>
+*Note:*
 
 . The length of given words won't exceed 500.
 . Characters in given words can only be lower-case letters.