重组计划以满足某些标准，可以使用一些建议

Question

（对不起，如果我问的问题太多了）

现在我只是想弄清楚如何重组我编写的程序以满足标准。我想将它分成不同的方法以使其更易于阅读，但我无法让不同的方法相互配合（例如变量范围错误）。

现在我的代码如下：

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace Scoring {
class Program {

    static int highOccurrence = 0;
    static int lowOccurrence = 0;

    static void Main(string[] args) {
        int[] scores = { 4, 7, 9, 3, 8, 6 };


        findScore(scores);
        ExitProgram();
    }


    static int findOccurrence(int[] scores) { //find the number of times a high/low occurs

        for (int i = 0; i < scores.Length; i++) {

            if (low == scores[i]) {

                lowOccurrence++;
                //record number of time slow occurs
            }

            if (high == scores[i]) {


                highOccurrence++;

                //record number of times high occurs
            }

            }

    }

    static int findScore(int[] scores) {


        int[] arrofNormal = new int[scores.Length];

        int low = scores[0];
        int high = scores[0];
        int total = 0;


        //int highOccurrence = 0;
        //int lowOccurrence = 0;


        for (int i = 0; i < scores.Length; i++) {

           // if (low == scores[i]) {

           //     lowOccurrence++;
           //     //record number of time slow occurs
           // }

           // if (high == scores[i]) {


           //     highOccurrence++;

           //     //record number of times high occurs
           // }

            if (low > scores[i]) {

                low = scores[i];


            } //record lowest value


            if (high < scores[i]) {

                high = scores[i];

                //record highest value
            }


        }

        for (int x = 0; x < scores.Length; x++) {

            if (scores[x] != low && scores[x] != high) {

                arrofNormal[x] = scores[x];
                 //provides the total of the scores (not including the high and the low) 
            }

            total += arrofNormal[x];

        }

        if (highOccurrence > 1) { //if there is more than 1 high (or 1 low) it is added once into the total

            total += high;

            if (lowOccurrence > 1) {

                total += low;
            }
        }


        Console.WriteLine("Sum = " + total);



        return total; //remove not all code paths return.. error


    }



    static void ExitProgram() {
        Console.Write("\n\nPress any key to exit program: ");
        Console.ReadKey();
    }//end ExitProgram

}
}

如您所见，它仍然是一项非常有进展的工作。我收到诸如“变量名”在当前上下文中不存在之类的错误，我知道这是一个范围错误，我该如何解决？建议将不胜感激:)

Answer 1

是的，您可以在 10 秒内用 Linq 编写此代码，但我认为您正在尝试学习 C# 的基本方面，而 Linq 对此无济于事。 您的问题是您正在尝试使用不同方法的变量（即使它是静态的，也没关系）。如果您在特定范围内需要参数，可以将参数添加到 findOccurrence 方法。

private static void findOccurrence(int[] scores, int low, int high)
    { //find the number of times a high/low occurs
        for (int i = 0; i < scores.Length; i++)
        {
            if (low == scores[i])
            {
                lowOccurrence++;
                //record number of time slow occurs
            }

            if (high == scores[i])
            {
                highOccurrence++;

                //record number of times high occurs
            }
        }
    }

在 findScore() 中你可以像这样调用上面的方法：

        findOccurrence(scores, low, high);

        if (highOccurrence > 1)
        { //if there is more than 1 high (or 1 low) it is added once into the total
            total += high;

            if (lowOccurrence > 1)
            {
                total += low;
            }
        }

我希望这会按预期工作。愉快地学习 C#

Answer 2

这应该让你开始:)

您需要将high 和low 移出findScore 方法并使用0 而不是scores[0] 进行初始化。然后你必须在调用findOccurrence 之前调用findScore 以允许这两个变量在需要时包含你想要的值。

而且看起来您来自 Java 背景。在 C# 中，根据命名约定，所有方法都应以大写字母开头。

您可以从 Linq 中受益匪浅。例如，您可以找到 low 和 scores.Min() 和 high 和 scores.Max()。

findOccurrence 可以写得更简洁：

static int FindOccurence(int[] scores)
{
    lowOccurrence = scores.Count(s => s == low);
    highOccurrence = scores.Count(s => s == high);
}

这样的事情会提高我的可读性。

这是Introduction to LINQ