format the image urls

Author: diguage

docs/0011-container-with-most-water.adoc

@@ -8,7 +8,7 @@ Given _n_ non-negative integers _a~1~_, _a~2~_, ..., _a~n ~_, where each represe
 
  
 
-<img alt="" src="https://s3-lc-upload.s3.amazonaws.com/uploads/2018/07/17/question_11.jpg" style="width: 600px; height: 287px;" />
+image::https://s3-lc-upload.s3.amazonaws.com/uploads/2018/07/17/question_11.jpg[]
 
 [.small]#The above vertical lines are represented by array [1,8,6,2,5,4,8,3,7]. In this case, the max area of water (blue section) the container can contain is 49. #
 

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

@@ -6,7 +6,7 @@ Given a string containing digits from `2-9` inclusive, return all possible lette
 
 A mapping of digit to letters (just like on the telephone buttons) is given below. Note that 1 does not map to any letters.
 
-<img src="http://upload.wikimedia.org/wikipedia/commons/thumb/7/73/Telephone-keypad2.svg/200px-Telephone-keypad2.svg.png" />
+image::http://upload.wikimedia.org/wikipedia/commons/thumb/7/73/Telephone-keypad2.svg/200px-Telephone-keypad2.svg.png[]
 
 *Example:*
 

docs/0036-valid-sudoku.adoc

@@ -13,7 +13,7 @@ Determine if a 9x9 Sudoku board is valid. Only the filled cells need to be valid
 * Each of the 9 `3x3` sub-boxes of the grid must contain the digits `1-9` without repetition.
 
 
-<img src="https://upload.wikimedia.org/wikipedia/commons/thumb/f/ff/Sudoku-by-L2G-20050714.svg/250px-Sudoku-by-L2G-20050714.svg.png" style="height:250px; width:250px" />
+image::https://upload.wikimedia.org/wikipedia/commons/thumb/f/ff/Sudoku-by-L2G-20050714.svg/250px-Sudoku-by-L2G-20050714.svg.png[]
 
 
 [.small]#A partially filled sudoku which is valid.#

docs/0037-sudoku-solver.adoc

@@ -14,12 +14,12 @@ A sudoku solution must satisfy *all of the following rules*:
 
 Empty cells are indicated by the character `'.'`.
 
-<img src="https://upload.wikimedia.org/wikipedia/commons/thumb/f/ff/Sudoku-by-L2G-20050714.svg/250px-Sudoku-by-L2G-20050714.svg.png" style="height:250px; width:250px" />
+image::https://upload.wikimedia.org/wikipedia/commons/thumb/f/ff/Sudoku-by-L2G-20050714.svg/250px-Sudoku-by-L2G-20050714.svg.png[]
 
 
 [.small]#A sudoku puzzle...#
 
-<img src="https://upload.wikimedia.org/wikipedia/commons/thumb/3/31/Sudoku-by-L2G-20050714_solution.svg/250px-Sudoku-by-L2G-20050714_solution.svg.png" style="height:250px; width:250px" />
+image::https://upload.wikimedia.org/wikipedia/commons/thumb/3/31/Sudoku-by-L2G-20050714_solution.svg/250px-Sudoku-by-L2G-20050714_solution.svg.png[]
 
 
 [.small]#...and its solution numbers marked in red.#

docs/0042-trapping-rain-water.adoc

@@ -4,7 +4,7 @@ https://leetcode.com/problems/trapping-rain-water/[LeetCode - Trapping Rain Wate
 
 Given _n_ non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining.
 
-<img src="https://assets.leetcode.com/uploads/2018/10/22/rainwatertrap.png" style="width: 412px; height: 161px;" />
+image::https://assets.leetcode.com/uploads/2018/10/22/rainwatertrap.png[]
 
 
 [.small]#The above elevation map is represented by array [0,1,0,2,1,0,1,3,2,1,2,1]. In this case, 6 units of rain water (blue section) are being trapped. *Thanks Marcos* for contributing this image!#

docs/0051-n-queens.adoc

@@ -52,7 +52,7 @@ image::images/0051-2.png[]
 
 The _n_-queens puzzle is the problem of placing _n_ queens on an _n_×_n_ chessboard such that no two queens attack each other.
 
-<img alt="" src="https://assets.leetcode.com/uploads/2018/10/12/8-queens.png" style="width: 258px; height: 276px;" />
+image::https://assets.leetcode.com/uploads/2018/10/12/8-queens.png[]
 
 Given an integer _n_, return all distinct solutions to the _n_-queens puzzle.
 

docs/0052-n-queens-ii.adoc

@@ -32,7 +32,7 @@ Explanation: There are two distinct solutions to the 4-queens puzzle as shown be
 
 The _n_-queens puzzle is the problem of placing _n_ queens on an _n_×_n_ chessboard such that no two queens attack each other.
 
-<img src="https://assets.leetcode.com/uploads/2018/10/12/8-queens.png" style="width: 258px; height: 276px;" />
+image::https://assets.leetcode.com/uploads/2018/10/12/8-queens.png[]
 
 Given an integer _n_, return the number of distinct solutions to the _n_-queens puzzle.
 

docs/0062-unique-paths.adoc

@@ -8,7 +8,7 @@ The robot can only move either down or right at any point in time. The robot is
 
 How many possible unique paths are there?
 
-<img src="https://assets.leetcode.com/uploads/2018/10/22/robot_maze.png" style="width: 400px; height: 183px;" />
+image::https://assets.leetcode.com/uploads/2018/10/22/robot_maze.png[]
 
 
 [.small]#Above is a 7 x 3 grid. How many possible unique paths are there?#

docs/0063-unique-paths-ii.adoc

@@ -8,7 +8,7 @@ The robot can only move either down or right at any point in time. The robot is
 
 Now consider if some obstacles are added to the grids. How many unique paths would there be?
 
-<img src="https://assets.leetcode.com/uploads/2018/10/22/robot_maze.png" style="width: 400px; height: 183px;" />
+image::https://assets.leetcode.com/uploads/2018/10/22/robot_maze.png[]
 
 An obstacle and empty space is marked as `1` and `0` respectively in the grid.
 

docs/0084-largest-rectangle-in-histogram.adoc

@@ -6,14 +6,14 @@ Given _n_ non-negative integers representing the histogram's bar height where th
 
 
 
-<img src="https://assets.leetcode.com/uploads/2018/10/12/histogram.png" style="width: 188px; height: 204px;" />
+image::https://assets.leetcode.com/uploads/2018/10/12/histogram.png[]
 
 
 [.small]#Above is a histogram where width of each bar is 1, given height = `[2,1,5,6,2,3]`.#
 
 
 
-<img src="https://assets.leetcode.com/uploads/2018/10/12/histogram_area.png" style="width: 188px; height: 204px;" />
+image::https://assets.leetcode.com/uploads/2018/10/12/histogram_area.png[]
 
 
 [.small]#The largest rectangle is shown in the shaded area, which has area = `10` unit.#

docs/0118-pascals-triangle.adoc

@@ -4,7 +4,7 @@ https://leetcode.com/problems/pascals-triangle/[LeetCode - Pascal's Triangle]
 
 Given a non-negative integer _numRows_, generate the first _numRows_ of Pascal's triangle.
 
-<img alt="" src="https://upload.wikimedia.org/wikipedia/commons/0/0d/PascalTriangleAnimated2.gif" style="height:240px; width:260px" />
+image::https://upload.wikimedia.org/wikipedia/commons/0/0d/PascalTriangleAnimated2.gif[]
 
 
 [.small]#In Pascal's triangle, each number is the sum of the two numbers directly above it.#

docs/0119-pascals-triangle-ii.adoc

@@ -6,7 +6,7 @@ Given a non-negative index _k_ where _k_ ≤ 33, return the _k_^th^ index row of
 
 Note that the row index starts from 0.
 
-<img alt="" src="https://upload.wikimedia.org/wikipedia/commons/0/0d/PascalTriangleAnimated2.gif" />
+image::https://upload.wikimedia.org/wikipedia/commons/0/0d/PascalTriangleAnimated2.gif[]
 
 
 [.small]#In Pascal's triangle, each number is the sum of the two numbers directly above it.#

docs/0133-clone-graph.adoc

@@ -28,7 +28,9 @@ The given node will always be the first node with `val = 1`. You must return the
 
 
 *Example 1:*
-<img alt="" src="https://assets.leetcode.com/uploads/2019/11/04/133_clone_graph_question.png" style="width: 500px; height: 550px;" />
+
+image::https://assets.leetcode.com/uploads/2019/11/04/133_clone_graph_question.png[]
+
 [subs="verbatim,quotes"]
 ----
 *Input:* adjList = [[2,4],[1,3],[2,4],[1,3]]
@@ -41,7 +43,9 @@ The given node will always be the first node with `val = 1`. You must return the
 ----
 
 *Example 2:*
-<img alt="" src="https://assets.leetcode.com/uploads/2020/01/07/graph.png" style="width: 163px; height: 148px;" />
+
+image::https://assets.leetcode.com/uploads/2020/01/07/graph.png[]
+
 [subs="verbatim,quotes"]
 ----
 *Input:* adjList = [[]]
@@ -59,7 +63,9 @@ The given node will always be the first node with `val = 1`. You must return the
 ----
 
 *Example 4:*
-<img alt="" src="https://assets.leetcode.com/uploads/2020/01/07/graph-1.png" style="width: 272px; height: 133px;" />
+
+image::https://assets.leetcode.com/uploads/2020/01/07/graph-1.png[]
+
 [subs="verbatim,quotes"]
 ----
 *Input:* adjList = [[2],[1]]

docs/0138-copy-list-with-random-pointer.adoc

@@ -31,15 +31,19 @@ The Linked List is represented in the input/output as a list of `n` nodes. Each
 
  
 *Example 1:*
-<img alt="" src="https://assets.leetcode.com/uploads/2019/12/18/e1.png" style="width: 700px; height: 142px;" />
+
+image::https://assets.leetcode.com/uploads/2019/12/18/e1.png[]
+
 [subs="verbatim,quotes"]
 ----
 *Input:* head = [[7,null],[13,0],[11,4],[10,2],[1,0]]
 *Output:* [[7,null],[13,0],[11,4],[10,2],[1,0]]
 ----
 
 *Example 2:*
-<img alt="" src="https://assets.leetcode.com/uploads/2019/12/18/e2.png" style="width: 700px; height: 114px;" />
+
+image::https://assets.leetcode.com/uploads/2019/12/18/e2.png[]
+
 [subs="verbatim,quotes"]
 ----
 *Input:* head = [[1,1],[2,1]]
@@ -48,7 +52,7 @@ The Linked List is represented in the input/output as a list of `n` nodes. Each
 
 *Example 3:*
 
-*<img alt="" src="https://assets.leetcode.com/uploads/2019/12/18/e3.png" style="width: 700px; height: 122px;" />*
+*image::https://assets.leetcode.com/uploads/2019/12/18/e3.png[]*
 
 [subs="verbatim,quotes"]
 ----

docs/0141-linked-list-cycle.adoc

@@ -22,7 +22,7 @@ To represent a cycle in the given linked list, we use an integer `pos` which rep
 
 
 
-<img alt="" src="https://assets.leetcode.com/uploads/2018/12/07/circularlinkedlist.png" style="width: 300px; height: 97px; margin-top: 8px; margin-bottom: 8px;" />
+image::https://assets.leetcode.com/uploads/2018/12/07/circularlinkedlist.png[]
 
 *Example 2:*
 
@@ -35,7 +35,7 @@ To represent a cycle in the given linked list, we use an integer `pos` which rep
 
 
 
-<img alt="" src="https://assets.leetcode.com/uploads/2018/12/07/circularlinkedlist_test2.png" style="width: 141px; height: 74px;" />
+image::https://assets.leetcode.com/uploads/2018/12/07/circularlinkedlist_test2.png[]
 
 *Example 3:*
 
@@ -47,7 +47,7 @@ To represent a cycle in the given linked list, we use an integer `pos` which rep
 ----
 
 
-<img alt="" src="https://assets.leetcode.com/uploads/2018/12/07/circularlinkedlist_test3.png" style="width: 45px; height: 45px;" />
+image::https://assets.leetcode.com/uploads/2018/12/07/circularlinkedlist_test3.png[]
 
 
 

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

@@ -91,7 +91,7 @@ To represent a cycle in the given linked list, we use an integer `pos` which rep
 *Explanation:* There is a cycle in the linked list, where tail connects to the second node.
 ----
 
-<img alt="" src="https://assets.leetcode.com/uploads/2018/12/07/circularlinkedlist.png" style="height: 97px; width: 300px;" />
+image::https://assets.leetcode.com/uploads/2018/12/07/circularlinkedlist.png[]
 
 *Example 2:*
 
@@ -102,7 +102,7 @@ To represent a cycle in the given linked list, we use an integer `pos` which rep
 *Explanation:* There is a cycle in the linked list, where tail connects to the first node.
 ----
 
-<img alt="" src="https://assets.leetcode.com/uploads/2018/12/07/circularlinkedlist_test2.png" style="height: 74px; width: 141px;" />
+image::https://assets.leetcode.com/uploads/2018/12/07/circularlinkedlist_test2.png[]
 
 *Example 3:*
 
@@ -113,7 +113,7 @@ To represent a cycle in the given linked list, we use an integer `pos` which rep
 *Explanation:* There is no cycle in the linked list.
 ----
 
-<img alt="" src="https://assets.leetcode.com/uploads/2018/12/07/circularlinkedlist_test3.png" style="height: 45px; width: 45px;" />
+image::https://assets.leetcode.com/uploads/2018/12/07/circularlinkedlist_test3.png[]
 
 
 

docs/0147-insertion-sort-list.adoc

@@ -7,7 +7,7 @@ Sort a linked list using insertion sort.
 
 
 
-<img alt="" src="https://upload.wikimedia.org/wikipedia/commons/0/0f/Insertion-sort-example-300px.gif" style="height:180px; width:300px" />
+image::https://upload.wikimedia.org/wikipedia/commons/0/0f/Insertion-sort-example-300px.gif[]
 
 
 [.small]#A graphical example of insertion sort. The partial sorted list (black) initially contains only the first element in the list.

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

@@ -15,14 +15,16 @@ image::images/0160-4.png[]
 Write a program to find the node at which the intersection of two singly linked lists begins.
 
 For example, the following two linked lists:
-<a href="https://assets.leetcode.com/uploads/2018/12/13/160_statement.png" target="_blank"><img alt="" src="https://assets.leetcode.com/uploads/2018/12/13/160_statement.png" style="margin-top: 10px; margin-bottom: 10px; width: 400px; height: 130px;" /></a>
+
+image::https://assets.leetcode.com/uploads/2018/12/13/160_statement.png[]
 
 begin to intersect at node c1.
 
 
 
 *Example 1:*
-<a href="https://assets.leetcode.com/uploads/2018/12/13/160_example_1.png" target="_blank"><img alt="" src="https://assets.leetcode.com/uploads/2018/12/13/160_example_1.png" style="margin-top: 10px; margin-bottom: 10px; width: 400px; height: 130px;" /></a>
+
+image::https://assets.leetcode.com/uploads/2018/12/13/160_example_1.png[]
 
 [subs="verbatim,quotes"]
 ----
@@ -34,7 +36,8 @@ begin to intersect at node c1.
 
 
 *Example 2:*
-<a href="https://assets.leetcode.com/uploads/2018/12/13/160_example_2.png" target="_blank"><img alt="" src="https://assets.leetcode.com/uploads/2018/12/13/160_example_2.png" style="margin-top: 10px; margin-bottom: 10px; width: 350px; height: 136px;" /></a>
+
+image::https://assets.leetcode.com/uploads/2018/12/13/160_example_2.png[]
 
 [subs="verbatim,quotes"]
 ----
@@ -47,7 +50,8 @@ begin to intersect at node c1.
 
 
 *Example 3:*
-<a href="https://assets.leetcode.com/uploads/2018/12/13/160_example_3.png" target="_blank"><img alt="" src="https://assets.leetcode.com/uploads/2018/12/13/160_example_3.png" style="margin-top: 10px; margin-bottom: 10px; width: 200px; height: 126px;" /></a>
+
+image::https://assets.leetcode.com/uploads/2018/12/13/160_example_3.png[]
 
 [subs="verbatim,quotes"]
 ----

docs/0173-binary-search-tree-iterator.adoc

@@ -13,7 +13,7 @@ Calling `next()` will return the next smallest number in the BST.
 
 *Example:*
 
-*<img alt="" src="https://assets.leetcode.com/uploads/2018/12/25/bst-tree.png" style="width: 189px; height: 178px;" />*
+image::https://assets.leetcode.com/uploads/2018/12/25/bst-tree.png[]
 
 [subs="verbatim,quotes"]
 ----

docs/0218-the-skyline-problem.adoc

@@ -3,7 +3,8 @@
 https://leetcode.com/problems/the-skyline-problem/[LeetCode - The Skyline Problem]
 
 A city's skyline is the outer contour of the silhouette formed by all the buildings in that city when viewed from a distance. Now suppose you are *given the locations and height of all the buildings* as shown on a cityscape photo (Figure A), write a program to *output the skyline* formed by these buildings collectively (Figure B).
-<a href="/static/images/problemset/skyline1.jpg" target="_blank"><img alt="Buildings" src="https://assets.leetcode.com/uploads/2018/10/22/skyline1.png" style="max-width: 45%; border-width: 0px; border-style: solid;" /> </a> <a href="/static/images/problemset/skyline2.jpg" target="_blank"> <img alt="Skyline Contour" src="https://assets.leetcode.com/uploads/2018/10/22/skyline2.png" style="max-width: 45%; border-width: 0px; border-style: solid;" /> </a>
+
+image::https://assets.leetcode.com/uploads/2018/10/22/skyline1.png[] </a> <a href="/static/images/problemset/skyline2.jpg" target="_blank"> image::https://assets.leetcode.com/uploads/2018/10/22/skyline2.png[]
 
 The geometric information of each building is represented by a triplet of integers `[Li, Ri, Hi]`, where `Li` and `Ri` are the x coordinates of the left and right edge of the ith building, respectively, and `Hi` is its height. It is guaranteed that `0 ≤ Li, Ri ≤ INT_MAX`, `0 < Hi ≤ INT_MAX`, and `Ri - Li > 0`. You may assume all buildings are perfect rectangles grounded on an absolutely flat surface at height 0.
 

docs/0223-rectangle-area.adoc

@@ -6,7 +6,7 @@ Find the total area covered by two *rectilinear* rectangles in a *2D* plane.
 
 Each rectangle is defined by its bottom left corner and top right corner as shown in the figure.
 
-<img alt="Rectangle Area" src="https://assets.leetcode.com/uploads/2018/10/22/rectangle_area.png" style="width: 542px; height: 304px;" />
+image::https://assets.leetcode.com/uploads/2018/10/22/rectangle_area.png[]
 
 *Example:*
 

docs/0235-lowest-common-ancestor-of-a-binary-search-tree.adoc

@@ -7,7 +7,8 @@ Given a binary search tree (BST), find the lowest common ancestor (LCA) of two g
 According to the https://en.wikipedia.org/wiki/Lowest_common_ancestor[definition of LCA on Wikipedia]: “The lowest common ancestor is defined between two nodes p and q as the lowest node in T that has both p and q as descendants (where we allow *a node to be a descendant of itself*).”
 
 Given binary search tree:  root = [6,2,8,0,4,7,9,null,null,3,5]
-<img alt="" src="https://assets.leetcode.com/uploads/2018/12/14/binarysearchtree_improved.png" style="width: 200px; height: 190px;" />
+
+image::https://assets.leetcode.com/uploads/2018/12/14/binarysearchtree_improved.png[]
 
 
 *Example 1:*

docs/0236-lowest-common-ancestor-of-a-binary-tree.adoc

@@ -17,7 +17,8 @@ Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in
 According to the https://en.wikipedia.org/wiki/Lowest_common_ancestor[definition of LCA on Wikipedia]: “The lowest common ancestor is defined between two nodes p and q as the lowest node in T that has both p and q as descendants (where we allow *a node to be a descendant of itself*).”
 
 Given the following binary tree:  root = [3,5,1,6,2,0,8,null,null,7,4]
-<img alt="" src="https://assets.leetcode.com/uploads/2018/12/14/binarytree.png" style="width: 200px; height: 190px;" />
+
+image::https://assets.leetcode.com/uploads/2018/12/14/binarytree.png[]
 
 
 *Example 1:*

docs/0237-delete-node-in-a-linked-list.adoc

@@ -16,7 +16,7 @@ Write a function to delete a node (except the tail) in a singly linked list, giv
 
 Given linked list -- head = [4,5,1,9], which looks like following:
 
-<img alt="" src="https://assets.leetcode.com/uploads/2018/12/28/237_example.png" style="margin-top: 5px; margin-bottom: 5px; width: 300px; height: 49px;" />
+image::https://assets.leetcode.com/uploads/2018/12/28/237_example.png[]
 
 
 

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

@@ -5,7 +5,7 @@ https://leetcode.com/problems/range-sum-query-2d-immutable/[LeetCode - Range Sum
 Given a 2D matrix _matrix_, find the sum of the elements inside the rectangle defined by its upper left corner (_row_1, _col_1) and lower right corner (_row_2, _col_2).
 
 
-<img src="/static/images/courses/range_sum_query_2d.png" border="0" alt="Range Sum Query 2D" />
+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*.#