readme

Author: jackzhenguo

README.md

@@ -2,14 +2,13 @@
 * Welcome to visit my CSDN blog(http://blog.csdn.net/daigualu) 
 * CSDN Column(http://blog.csdn.net/column/details/14761.html) where detail solutions are.
 ## `Today Update`
-### Tree
-####  105 Construct Binary Tree from Preorder and Inorder Traversal
-*  [Github:#105 Construct Binary Tree from Preorder and Inorder Traversal](/Tree/Tree.TreeLib/BuildTreeByPreAndInorder.cs)
-*  [CSDN:#105 Construct Binary Tree from Preorder and Inorder Traversal](http://blog.csdn.net/daigualu/article/details/72127022)
+### Math
+####  453 Minimum Moves to Equal Array Elements
+*  [Github:#453 Minimum Moves to Equal Array Elements](/Math/Math.Lib/MinimumMovesSln.cs)
+*  [CSDN:#453 Minimum Moves to Equal Array Elements](http://blog.csdn.net/daigualu/article/details/72354061)
 *  Tips:
-   * the most important function in solving this issue is 
-       *  private TreeNode bulidTree(int preStart, int inStart, int inEnd) ;
-   * Plus, preStart index in preorder is the root index, which is also the separate point in inorder and it’s left is left subtree and right is right subtree.
+   * using Math equation to solve this issue!
+
 ---
 ---
 
@@ -228,4 +227,11 @@ Tags are following:
      * apply 1: valid stack oepration: ((ab)c)d     (a(bc))d     (ab)(cd)     a((bc)d)     a(b(cd))
 	 * apply 2: ![binary trees](/Tree/Tree.TreeLib/binarytrees.jpg)
 	 * apply 3: ![triangles](/Tree/Tree.TreeLib/triangles.jpg)
-	 * apply 4: ![stairs](/Tree/Tree.TreeLib/stairs.jpg)
+	 * apply 4: ![stairs](/Tree/Tree.TreeLib/stairs.jpg)
+####  105 Construct Binary Tree from Preorder and Inorder Traversal
+*  [Github:#105 Construct Binary Tree from Preorder and Inorder Traversal](/Tree/Tree.TreeLib/BuildTreeByPreAndInorder.cs)
+*  [CSDN:#105 Construct Binary Tree from Preorder and Inorder Traversal](http://blog.csdn.net/daigualu/article/details/72127022)
+*  Tips:
+   * the most important function in solving this issue is 
+       *  private TreeNode bulidTree(int preStart, int inStart, int inEnd) ;
+   * Plus, preStart index in preorder is the root index, which is also the separate point in inorder and it’s left is left subtree and right is right subtree.