LeetCode 453. Minimum Moves to Equal Array Elements C#

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]

Solution:

incrementing n-1 elements by one, means every time need to increment 1 to every number except the maximum. but it's hard to implement.

Increment to every nums except max, is as same as decrement 1 on one number until every number equals min number.

 public class Solution {
     public int MinMoves(int[] nums) {
         if(nums.Length==)
         {
             return ;
         }
         int n = nums.Length;
         //Find min value in nums;
         int min =nums[];
         foreach(int num in nums)
         {
             min = Math.Min(min, num);
         }

         //calculate the difference of every num from nums and min; ths sum should be the min Moves
         //add 1 to n-1 is same as minus 1 from the max each time.
         int moves = ;
         foreach(int num in nums)
         {
             moves +=(num-min);
         }
         return  moves;
     }
 }