在2D数组中添加最大值和最小值，不包括最高和最低整数

Question

I have a 2D array and I want to output the sum of the values for each array individually but also exclude the maximum and minimum values from the calculation of that sum. EG if array = { {2, 3, 4, 5}, {4, 5, 6, 7} }. then the code should exclude 2 and 5 from the first array and just add and output 9 (3 + 4), and then output 11 for the second array (5 + 6). Also if the array contains 2 ore more of the lowest value and two or more of the highest value it should exclude only 1 of those however many similar values EG if the array = {2, 2, 3, 4, 5, 6, 6} the code should output 20 (2 + 3 + 4 + 5 + 6).

I have attempted coding this myself however my values are not showing up. I think it might have something to do with my scores_total equalling 0 but I don't know how else to declare it.

any help would be appreciated.

results array is stored in main

static void JudgesTotal(int[,] results)
{
    int Minimum = results[0, 0];
    int Maximum = results[0, 0];
    int score_total = 0;

    for (int i = 0; i < results.GetLength(0); i++)
    {
        score_total = score_total + results[i, j];
        if (Minimum > results[i, j])
        {
            Minimum = results[i, j];
        }

        if (Maximum < results[i, j])
        {
            Maximum = results[i, j];
        }

        score_total = score_total - (Maximum - Minimum);

        if (results[i, j] > results[i, j] + 1)
        {
            Console.Write("{0}", score_total);
        }
    }
}

Answer 1

There are a number of problems with your code. First you don't reset the Minimum and Maximum at the start of the next array. Second you don't reset the score_total at the start of each new array. Next, your comparison for the max value is wrong. And finally you have to subtract out the min and max after the inner loop finishes. Here's an example of how to fix all those issues. Also I'm not clear on why you had if(result[i,j] > result[i,j] + 1) in there since it would only be true if result[i,j] was int.MaxValue .

for(int i = 0; i < results.GetLength(0); i++)
{
    if(results.GetLength(1) <= 2)
    {
        //There are either 0 items which would sum to 0
        //Or 1 item which is both the min and max and the sum should be 0
        //Or 2 items where one is the min and the other the max and the sum should be 0
        Console.WriteLine(0);
        continue;
    }

    long min = results[i,0];
    long max = results[i,0];
    long total = 0;
    for(int j = 0; j < results.GetLength(1); j++)
    {
        total += results[i,j];
        if(results[i,j] < min)
            min = results[i,j];
        if(max < results[i,j])
            max = results[i,j];
    }
    total -= (min + max);
    Console.WritLine(total);
}

Note I made the min , max , and the total of type long to avoid potential overflows. total because summing up enough integers or large integers could result in a value that doesn't fit in an int . Worse case is an array of size int.MaxValue where all the items are int.MaxValue and the total woudl be int.MaxValue * int.MaxValue and that will fit in long . The min and max are long because we add them and int.MaxValue + int.MaxValue doesn't fit in int , but does fit in long . Also the same ideas holds for int.MinValue as well.