Update readme.md

Author: javadev

src/main/java/g0101_0200/s0120_triangle/readme.md

@@ -12,7 +12,14 @@ For each step, you may move to an adjacent number of the row below. More formall
 
 **Output:** 11
 
-**Explanation:** The triangle looks like: <ins>2</ins> <ins>3</ins> 4 6 <ins>5</ins> 7 4 <ins>1</ins> 8 3 The minimum path sum from top to bottom is 2 + 3 + 5 + 1 = 11 (underlined above). 
+**Explanation:**
+
+    The triangle looks like:
+        2
+       3 4
+      6 5 7
+     4 1 8 3
+     The minimum path sum from top to bottom is 2 + 3 + 5 + 1 = 11 (underlined above).
 
 **Example 2:**
 
@@ -27,4 +34,4 @@ For each step, you may move to an adjacent number of the row below. More formall
 *   `triangle[i].length == triangle[i - 1].length + 1`
 *   <code>-10<sup>4</sup> <= triangle[i][j] <= 10<sup>4</sup></code>
 
-**Follow up:** Could you do this using only `O(n)` extra space, where `n` is the total number of rows in the triangle?
+**Follow up:** Could you do this using only `O(n)` extra space, where `n` is the total number of rows in the triangle?