README

Author: jackzhenguo

README.md

@@ -126,24 +126,32 @@ Tags are following:
 
 ## Details
 ## Array
-* [#35 Search Insert Position](/Array/Array.Console/Array.Lib/SearchInsertPosition.cs)
-
-* [#118 	Pascal’s Triangle](/Array/Array.Console/Array.Lib/PascalsTriangle.cs)
-
-* [#119 	Pascal’s Triangle II](/Array/Array.Console/Array.Lib/PascalsTriangleII.cs)
-
-* [#414 	Third Maximum Number](/Array/Array.Console/Array.Lib/ThirdMaximumNumber.cs)
-
-* [#66 Plus One](http://blog.csdn.net/daigualu/article/details/71056697)
-
-* [#121 Best time to buy and sell stock](http://blog.csdn.net/daigualu/article/details/71038726)
-
-* [#26	Remove Duplicates from Sorted Array](http://blog.csdn.net/daigualu/article/details/71064545)
-
-
-* [#122 BestTimeToBuyandSellStockII](http://blog.csdn.net/daigualu/article/details/71104584)
-
-* [#27 Remove element](http://blog.csdn.net/daigualu/article/details/71104482)
+|Number| Title | Blog |
+|------|-------|------|
+35	|[Search Insert Position](http://blog.csdn.net/daigualu/article/details/66995617)
+118|	[Pascal's Triangle](http://blog.csdn.net/daigualu/article/details/67006388)
+119	|[Pascal's Triangle II](http://blog.csdn.net/daigualu/article/details/67069088)
+414|	[Third Maximum Number](http://blog.csdn.net/daigualu/article/details/68063481)
+121|	[Best Time to Buy and Sell Stock](http://blog.csdn.net/daigualu/article/details/71038726)
+66|	[Plus One](http://blog.csdn.net/daigualu/article/details/71056697)
+26	|[Remove Duplicates from Sorted Array](http://blog.csdn.net/daigualu/article/details/71064545)
+27|	[Remove Element](http://blog.csdn.net/daigualu/article/details/71104482)
+122	|[Best Time to Buy and Sell Stock II](http://blog.csdn.net/daigualu/article/details/71104584)
+268	|[Missing Number](http://blog.csdn.net/daigualu/article/details/69220202)
+217|	[Contains Duplicate](http://blog.csdn.net/daigualu/article/details/71123673)
+532|	[K-diff Pairs in an Array](http://blog.csdn.net/daigualu/article/details/71129806)
+189|	[Rotate Array](http://blog.csdn.net/daigualu/article/details/71159419)
+169	|[Majority Element](http://blog.csdn.net/daigualu/article/details/69937729)
+167	|[Two Sum II - Input array is sorted](http://blog.csdn.net/daigualu/article/details/69787679)
+88	|[Merge Sorted Array](http://blog.csdn.net/daigualu/article/details/69367334)
+53	|[Maximum Subarray](http://blog.csdn.net/daigualu/article/details/69936974)
+485	|[Max Consecutive Ones](http://blog.csdn.net/daigualu/article/details/71216338)
+283	|[Move Zeroes](http://blog.csdn.net/daigualu/article/details/69329038)
+448	|[Find All Numbers Disappeared in an Array](http://blog.csdn.net/daigualu/article/details/71168875)
+1|	[Two Sum](http://blog.csdn.net/daigualu/article/details/68957096)
+219	|[Contains Duplicate II](http://blog.csdn.net/daigualu/article/details/71166985)
+566| [Reshape the Matrix](http://blog.csdn.net/daigualu/article/details/71275325)	
+561| [Array Partition I](http://blog.csdn.net/daigualu/article/details/71273279)	
 
 #### 532 K-diff Pairs in an Array
 *  [Github:#532 K-diff Pairs in an Array](/Array/Array.Lib/FindPairsSln.cs)