A: new

Author: Shuo

Diff for: problems/as-far-from-land-as-possible/README.md

@@ -11,44 +11,36 @@
 
 ## [1162. As Far from Land as Possible (Medium)](https://leetcode.com/problems/as-far-from-land-as-possible "地图分析")
 
-<p>Given an N x N <code>grid</code>&nbsp;containing only values <code>0</code> and <code>1</code>, where&nbsp;<code>0</code> represents water&nbsp;and <code>1</code> represents land, find a water cell such that its distance to the nearest land cell is maximized and return the distance.</p>
+<p>Given an <code>n x n</code> <code>grid</code>&nbsp;containing only values <code>0</code> and <code>1</code>, where&nbsp;<code>0</code> represents water&nbsp;and <code>1</code> represents land, find a water cell such that its distance to the nearest land cell is maximized, and return the distance.&nbsp;If no land or water exists in the grid, return <code>-1</code>.</p>
 
-<p>The distance used in this problem is the <em>Manhattan distance</em>:&nbsp;the distance between two cells <code>(x0, y0)</code> and <code>(x1, y1)</code> is <code>|x0 - x1| + |y0 - y1|</code>.</p>
-
-<p>If no land or water exists in the grid, return <code>-1</code>.</p>
+<p>The distance used in this problem is the Manhattan distance:&nbsp;the distance between two cells <code>(x0, y0)</code> and <code>(x1, y1)</code> is <code>|x0 - x1| + |y0 - y1|</code>.</p>
 
 <p>&nbsp;</p>
-
 <p><strong>Example 1:</strong></p>
-
-<p><strong><img alt="" src="https://assets.leetcode.com/uploads/2019/05/03/1336_ex1.JPG" style="width: 185px; height: 87px;" /></strong></p>
-
+<img alt="" src="https://assets.leetcode.com/uploads/2019/05/03/1336_ex1.JPG" style="width: 185px; height: 87px;" />
 <pre>
-<strong>Input: </strong><span id="example-input-1-1">[[1,0,1],[0,0,0],[1,0,1]]</span>
-<strong>Output: </strong><span id="example-output-1">2</span>
-<strong>Explanation: </strong>
-The cell (1, 1) is as far as possible from all the land with distance 2.
+<strong>Input:</strong> grid = [[1,0,1],[0,0,0],[1,0,1]]
+<strong>Output:</strong> 2
+<strong>Explanation:</strong> The cell (1, 1) is as far as possible from all the land with distance 2.
 </pre>
 
 <p><strong>Example 2:</strong></p>
-
-<p><strong><img alt="" src="https://assets.leetcode.com/uploads/2019/05/03/1336_ex2.JPG" style="width: 184px; height: 87px;" /></strong></p>
-
+<img alt="" src="https://assets.leetcode.com/uploads/2019/05/03/1336_ex2.JPG" style="width: 184px; height: 87px;" />
 <pre>
-<strong>Input: </strong><span id="example-input-2-1">[[1,0,0],[0,0,0],[0,0,0]]</span>
-<strong>Output: </strong><span id="example-output-2">4</span>
-<strong>Explanation: </strong>
-The cell (2, 2) is as far as possible from all the land with distance 4.
+<strong>Input:</strong> grid = [[1,0,0],[0,0,0],[0,0,0]]
+<strong>Output:</strong> 4
+<strong>Explanation:</strong> The cell (2, 2) is as far as possible from all the land with distance 4.
 </pre>
 
 <p>&nbsp;</p>
-
-<p><span><strong>Note:</strong></span></p>
-
-<ol>
-	<li><span><code>1 &lt;= grid.length == grid[0].length&nbsp;&lt;= 100</code></span></li>
-	<li><span><code>grid[i][j]</code>&nbsp;is <code>0</code> or <code>1</code></span></li>
-</ol>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>n == grid.length</code></li>
+	<li><code>n == grid[i].length</code></li>
+	<li><code>1 &lt;= n&nbsp;&lt;= 100</code></li>
+	<li><code>grid[i][j]</code>&nbsp;is <code>0</code> or <code>1</code></li>
+</ul>
 
 ### Related Topics
   [[Breadth-first Search](../../tag/breadth-first-search/README.md)]