冒泡排序作业出错

Question

基本上，我有作业要求我获取一个字符串数组和一个字符串搜索词，并返回搜索词在数组中的位置（如果未找到，则返回 -1）并获取一个字符串数组和冒泡把它分类。我收到了一个似乎只是冒泡排序的错误，我不知道为什么。

我得到的错误信息是：

Exception in thread "main" java.lang.NullPointerException
at java.lang.String$CaseInsensitiveComparator.compare(String.java:1193)
at java.lang.String$CaseInsensitiveComparator.compare(String.java:1186)
at java.lang.String.compareToIgnoreCase(String.java:1239)
at mmtextreader.MMTextReader.bubbleSort(MMTextReader.java:100)
at mmtextreader.MMTextReader.main(MMTextReader.java:47)

代码：

public class TextReader {

    /**
     * @param args the command line arguments
     * @throws java.io.FileNotFoundException
     */
    public static void main(String[] args) throws FileNotFoundException {
        // TODO code application logic here

        String[] Array;

        Array = wordPut("beowulf.txt");

        Scanner reader = new Scanner(System.in);

        System.out.println("Input word: ");

        String term = reader.next();

        int position = pFind(Array, term);

        if(position == -1) {
            System.out.println("no word found");
        } else {
            System.out.println(term + " is found at " + (position+1));
        }

        bubbleSort(Array);
    }

    public static String[] wordPut(String s) throws FileNotFoundException {
        String[] Array = new String[50000];

        Scanner reader = new Scanner(new BufferedReader(new FileReader(s))).useDelimiter("[^\\p{Alpha}']+");

        int wordcount = 0;
        while (reader.hasNext()) {
            Array[wordcount] = reader.next();
            wordcount++;
        }
        for (int i = 0; i < Array.length; i++) {
            if (Array[i] != null) {
                System.out.println(Array[i]);
            }
        }

        return Array;
    }

    public static String[] bubbleSort(String[] a) {
        int lElement = a.length - 1;
        boolean t = true;
        for (int i = 0; i <= a.length - 1; i++) {

            boolean swap = false;

            for (int j = 0; j < lElement; j++) {
                if (a[j].compareTo(a[j + 1]) > 0) {
                    String store = a[j];
                    a[j] = a[j + 1];
                    a[j + 1] = store;
                    swap = true;
                }
            }
            lElement--;
            if (swap == false) {
                break;
            }
        }
        for(int n = 0; n < a.length; n++) {
            System.out.println(a[n]);
        }
        return a;
    }

    public static int pFind(String[] a, String trm) {
        int pos = -1;
        for (int i = 0; i < a.length; i++) {
            if (a[i].compareToIgnoreCase(trm) == 0) {
                pos = i;
                break;
            }
        }
        return pos;
    }

}

Answer 1

好的！我检查了您的代码，您唯一的问题是您将数组初始化为 5000 的大小，这是 wordPut() 方法中的问题

  String[] Array = new String[50000];

我在我的电脑上试过你的代码，工作正常，冒泡排序也很顺利，除了声明数组，试着找出数组的大小然后声明！