Merge branch 'master' of github.com:jackzhenguo/leetcode-csharp

Author: jackzhenguo

Math/Math.Lib/MinimumMovesSln.cs

@@ -0,0 +1,39 @@
+using System;
+using System.Collections.Generic;
+using System.Text;
+
+namespace leetcodeTest
+{
+    //    Given a non-empty integer array of size n, find the minimum number of moves required to make all array elements equal, where a move is incrementing n - 1 elements by 1.
+
+    //Example:
+
+    //Input:
+    //[1,2,3]
+
+    //    Output:
+    //3
+
+    //Explanation:
+    //Only three moves are needed(remember each move increments two elements):
+
+    //[1,2,3]  =>  [2,3,3]  =>  [3,4,3]  =>  [4,4,4]
+    //[1,3,3]  =>  [3,3,5]  =>  [5,5,5]
+    public class MinimumMovesSln
+    {
+        public int MinMoves(int[] nums)
+        {
+            //assume moving m times, so m*(n-1) + sum_init = n * (min+m) // min+m is the final number
+            //sum = n*min + m => m = sum - n* min;
+            int min = nums[0];
+            int sum = 0;
+            for (int i = 0; i < nums.Length; i++)
+            {
+                if (nums[i] < min) min = nums[i];
+                sum += nums[i];
+            }
+            return sum - nums.Length * min;
+        }
+
+    }
+}

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.