From 8e05796f373fed22e8ac80d07376d4dffd594e90 Mon Sep 17 00:00:00 2001
From: YDZ <ydz627@gmail.com>
Date: Sun, 15 Apr 2018 15:46:57 +0800
Subject: [PATCH] =?UTF-8?q?=E6=9B=B4=E6=96=B0=E9=A2=98=E7=9B=AE=E6=8F=8F?=
 =?UTF-8?q?=E8=BF=B0?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .../41.First-Missing-Positive/README.md       | 29 ++++++++++++-------
 1 file changed, 19 insertions(+), 10 deletions(-)

diff --git a/Algorithms/41.First-Missing-Positive/README.md b/Algorithms/41.First-Missing-Positive/README.md
index 23b3d5e9..8c54813d 100644
--- a/Algorithms/41.First-Missing-Positive/README.md
+++ b/Algorithms/41.First-Missing-Positive/README.md
@@ -4,18 +4,27 @@
 
 Given an unsorted integer array, find the smallest missing positive integer.
 
-Example 1:
+Example 1:  
 
-Input: [1,2,0]
-Output: 3
-Example 2:
+```
+Input: [1,2,0]  
+Output: 3  
+```
 
-Input: [3,4,-1,1]
-Output: 2
-Example 3:
+Example 2:  
 
-Input: [7,8,9,11,12]
-Output: 1
-Note:
+```
+Input: [3,4,-1,1]  
+Output: 2  
+```
+
+Example 3:  
+
+```
+Input: [7,8,9,11,12]  
+Output: 1  
+```
+
+Note:  
 
 Your algorithm should run in O(n) time and uses constant extra space.
\ No newline at end of file