为什么我会收到“静态错误：此类没有接受 String[] 的静态 void main 方法。”即使我有它？答案

【问题标题】：Why do I get "Static Error: This class does not have a static void main method accepting String[]." even though I have it?为什么我会收到“静态错误：此类没有接受 String[] 的静态 void main 方法。”即使我有它？
【发布时间】：2014-12-16 04:11:15
【问题描述】：

我收到“静态错误：此类没有接受 String[] 的静态 void main 方法。”即使我将“public static void main(String args[])”作为我的代码的一部分使用 Dr. Java

public static void main(String args[]) throws Exception {

    // just for testing purposes
    int myArray[] = {4,6,8,1,3,2,9,5,7,6,4,2,1,3,9,8,7,5};
    mergeSort(myArray);
    System.out.println("Sorted array is:\n");
    for (int i = 0; i < myArray.length; i++) {
        System.out.print(myArray[i] + " ");
    }
    System.out.println();
}

上面有代码，我没有错误，但是当我尝试运行代码时，我得到了那个错误。提前致谢。

下面是除对象类之外的代码

class MergeSortNonRecursive {

    static Stack<ProgramFrame> callStack;

    // this implement the merge algorithm seen in class. Feel free to call it.
    public static void merge(int A[], int start, int mid, int stop) {
        int index1 = start;
        int index2 = mid + 1;
        int tmp[] = new int[A.length];
        int indexTmp = start;

        while (indexTmp <= stop) {
            if (index1 <= mid && (index2 > stop || A[index1] <= A[index2])) {
                tmp[indexTmp] = A[index1];
                index1++;
            } else {
                if (index2 <= stop && (index1 > mid || A[index2] <= A[index1])) {
                    tmp[indexTmp] = A[index2];
                    index2++;
                }
            }
            indexTmp++;
        }
        for (int i = start; i <= stop; i++) A[i] = tmp[i];
    }

    static void mergeSort(int A[]) {
        /* WRITE YOUR CODE HERE */
        //stack we use
        callStack = new Stack<ProgramFrame>();

        //initial program frame
        ProgramFrame current = new ProgramFrame(0, A.length - 1, 1);

        //put frame on stack
        callStack.push(current);

        //as long as our stack isn't empty...
        while (!callStack.empty()) {

            //as long as the top Frame contains more than one integer
            while (callStack.peek().start < callStack.peek().stop) {

                //must be defined before pushing or else the values mess up
                int left = callStack.peek().start;
                int middle = (callStack.peek().start + callStack.peek().stop) / 2;
                int right = callStack.peek().stop;

                current = new ProgramFrame(middle + 1, right, callStack.peek().PC++);
                callStack.push(current);
                //order ensures left is always on the top
                current = new ProgramFrame(left, middle, callStack.peek().PC++);
                callStack.push(current);
            }
            int PC = callStack.peek().PC; // need to check PC's
            int start = callStack.peek().start;  //assign start and mid for merge
            int mid = callStack.peek().stop; //assign left and middle for merge from the left frame
            callStack.pop();

            //required if the next Frame (the right frame) isn't at its base of 1 integer and they have to be the same PC otherwise this will run continously
            if ((callStack.peek().start != callStack.peek().stop) && (PC == callStack.peek().PC)) {

                //must be defined before pushing or else the values mess up
                int left = callStack.peek().start;
                int middle = (callStack.peek().start + callStack.peek().stop) / 2;
                int right = callStack.peek().stop;

                current = new ProgramFrame(middle + 1, right, callStack.peek().PC++);
                callStack.push(current);
                //order ensures left is always on the top
                current = new ProgramFrame(left, middle, callStack.peek().PC++);
                callStack.push(current);
            }

            int stop = callStack.peek().stop; //get stop from the right frame

            merge(A, start, mid, stop); //merge 
        }
    }

    //Static Error: This class does not have a static void main method accepting String[]. ??!??
    public static void main(String args[]) throws Exception {

        // just for testing purposes
        int myArray[] = {4,6,8,1,3,2,9,5,7,6,4,2,1,3,9,8,7,5};
        mergeSort(myArray);
        System.out.println("Sorted array is:\n");
        for (int i = 0; i < myArray.length; i++) {
            System.out.print(myArray[i] + " ");
        }
        System.out.println();
    }
}

整个代码如下，我的文件保存为 MergeSortNonRecursive.java

import java.util.*;
import java.io.*;

class ProgramFrame {
    int start;
    int stop;
    int PC;

    public ProgramFrame(int myStart, int myStop, int myPC) {
        start = myStart;
        stop = myStop;
        PC = myPC;
    }

    // returns a String describing the content of the object
    public String toString() {
        return "ProgramFrame: start = " + start + " stop = " + stop + " PC = " + PC;
    }
}

class MergeSortNonRecursive {

    static Stack<ProgramFrame> callStack;

    // this implement the merge algorithm seen in class. Feel free to call it.
    public static void merge(int A[], int start, int mid, int stop) {
        int index1 = start;
        int index2 = mid + 1;
        int tmp[] = new int[A.length];
        int indexTmp = start;

        while (indexTmp <= stop) {
            if (index1 <= mid && (index2 > stop || A[index1] <= A[index2])) {
                tmp[indexTmp] = A[index1];
                index1++;
            } else {
                if (index2 <= stop && (index1 > mid || A[index2] <= A[index1])) {
                    tmp[indexTmp] = A[index2];
                    index2++;
                }
            }
            indexTmp++;
        }
        for (int i = start; i <= stop; i++) A[i] = tmp[i];
    }

    static void mergeSort(int A[]) {
        /* WRITE YOUR CODE HERE */
        //stack we use
        callStack = new Stack<ProgramFrame>();

        //initial program frame
        ProgramFrame current = new ProgramFrame(0, A.length - 1, 1);

        //put frame on stack
        callStack.push(current);

        //as long as our stack isn't empty...
        while (!callStack.empty()) {

            //as long as the top Frame contains more than one integer
            while (callStack.peek().start < callStack.peek().stop) {

                //must be defined before pushing or else the values mess up
                int left = callStack.peek().start;
                int middle = (callStack.peek().start + callStack.peek().stop) / 2;
                int right = callStack.peek().stop;

                current = new ProgramFrame(middle + 1, right, callStack.peek().PC++);
                callStack.push(current);
                //order ensures left is always on the top
                current = new ProgramFrame(left, middle, callStack.peek().PC++);
                callStack.push(current);
            }
            int PC = callStack.peek().PC; // need to check PC's
            int start = callStack.peek().start;  //assign start and mid for merge
            int mid = callStack.peek().stop; //assign left and middle for merge from the left frame
            callStack.pop();

            //required if the next Frame (the right frame) isn't at its base of 1 integer and they have to be the same PC otherwise this will run continously
            if ((callStack.peek().start != callStack.peek().stop) && (PC == callStack.peek().PC)) {

                //must be defined before pushing or else the values mess up
                int left = callStack.peek().start;
                int middle = (callStack.peek().start + callStack.peek().stop) / 2;
                int right = callStack.peek().stop;

                current = new ProgramFrame(middle + 1, right, callStack.peek().PC++);
                callStack.push(current);
                //order ensures left is always on the top
                current = new ProgramFrame(left, middle, callStack.peek().PC++);
                callStack.push(current);
            }

            int stop = callStack.peek().stop; //get stop from the right frame

            merge(A, start, mid, stop); //merge 
        }
    }

    //Static Error: This class does not have a static void main method accepting String[]. ??!??
    public static void main(String args[]) throws Exception {

        // just for testing purposes
        int myArray[] = {4,6,8,1,3,2,9,5,7,6,4,2,1,3,9,8,7,5};
        mergeSort(myArray);
        System.out.println("Sorted array is:\n");
        for (int i = 0; i < myArray.length; i++) {
            System.out.print(myArray[i] + " ");
        }
        System.out.println();
    }
}

【问题讨论】：

你在编译正确的类吗？
是的，它们都在同一个类中。我建立在我的教授给出的代码之上。这部分已经写出来了，我没有改变任何东西，我班上似乎没有人遇到这个问题。
确保它不在内部类中。
向我们展示类头等
请向我们展示整个文件，而不仅仅是其中的这一部分。错误不在您显示的部分。

标签： java

【解决方案1】：

class MergeSortNonRecursive

需要：

public class MergeSortNonRecursive

包含main方法的类必须是public的。

更新：在 Dr Java 中尝试过 看起来 Java 博士正在尝试运行 ProgramFrame。我希望完整的输出是这样的：

Welcome to DrJava.  Working directory is /code
> run ProgramFrame
Static Error: This class does not have a static void main method accepting String[].

将类 ProgramFrame 放在公共类 MergeSortNonRecursive 之后使其工作。但是，您的合并排序有问题，它将永远循环。您需要对其进行调试。

【讨论】：

我已经公开了它仍然给出同样的错误。
并且该类在一个名为 MergeSortNonRecursive.java 的文件中？
是的。我很困惑，我的教授给了我代码，我所触及的只是 mergeSort 方法
您可以将堆栈跟踪的前 20 行左右粘贴到您的问题中吗？
我不知道该怎么做。我是新手，这是我的第二节计算机科学课

【解决方案2】：

一种可能性（根据经验）是，在从 Dr. Java 运行程序之前，请确保在屏幕的左栏中选择了正确的 java 类文件。例如，我的一个应用程序包含三个 java 类。如果我选择了包含 main 方法的类，那么它可以正常工作。但是，如果我在项目中选择了不同的类，则会收到错误消息：“静态错误：此类没有接受 String[] 的静态 void main 方法。”这个错误是有道理的，因为所选的类中没有 main 方法，但我希望 Dr. Java 会查看项目中的所有类以找到 main 方法。

【讨论】：