Update README.md

Author: skully-coder

Dynamic Programming/1162-as-far-from-land-as-possible/README.md

@@ -6,7 +6,7 @@ The distance used in this problem is the Manhattan distance: the distance betwe
 
 Example 1:
 
-[https://assets.leetcode.com/uploads/2019/05/03/1336_ex1.JPG]
+![https://assets.leetcode.com/uploads/2019/05/03/1336_ex1.JPG](https://assets.leetcode.com/uploads/2019/05/03/1336_ex1.JPG)
 
 
 Input: grid = [[1,0,1],[0,0,0],[1,0,1]]
@@ -16,7 +16,7 @@ Explanation: The cell (1, 1) is as far as possible from all the land with distan
 
 Example 2:
 
-[https://assets.leetcode.com/uploads/2019/05/03/1336_ex2.JPG]
+![https://assets.leetcode.com/uploads/2019/05/03/1336_ex2.JPG](https://assets.leetcode.com/uploads/2019/05/03/1336_ex2.JPG)
 
 
 Input: grid = [[1,0,0],[0,0,0],[0,0,0]]
@@ -31,4 +31,4 @@ Constraints:
  * n == grid.length
  * n == grid[i].length
  * 1 <= n <= 100
- * grid[i][j] is 0 or 1
+ * grid[i][j] is 0 or 1