Java数据结构实践：基于二维数组的州府首都问答系统开发指南

import java.util.Scanner;
import java.util.Arrays;

public class StateCapitalQuizApp {

    // 存储州名及其首都的二维数组
    public static String[][] StateAndCapital = {
            {"Alabama", "Montgomery"},
            {"Alaska", "Juneau"},
            {"Arizona", "Phoenix"},
            {"Arkansas", "Little Rock"},
            {"California", "Sacramento"},
            {"Colorado", "Denver"},
            {"Connecticut", "Hartford"},
            {"Delaware", "Dover"},
            {"Florida", "Tallahassee"},
            {"Georgia", "Atlanta"},
            {"Hawaii", "Honolulu"},
            {"Idaho", "Boise"},
            {"Illinois", "Springfield"},
            {"Indiana", "Indianapolis"},
            {"Iowa", "Des Moines"},
            {"Kansas", "Topeka"},
            {"Kentucky", "Frankfort"},
            {"Louisiana", "Baton Rouge"},
            {"Maine", "Augusta"},
            {"Maryland", "Annapolis"},
            {"Massachusetts", "Boston"},
            {"Michigan", "Lansing"},
            {"Minnesota", "Saint Paul"},
            {"Mississippi", "Jackson"},
            {"Missouri", "Jefferson City"},
            {"Montana", "Helena"},
            {"Nebraska", "Lincoln"},
            {"Nevada", "Carson City"},
            {"New Hampshire", "Concord"},
            {"New Jersey", "Trenton"},
            {"New Mexico", "Santa Fe"},
            {"New York", "Albany"},
            {"North Carolina", "Raleigh"},
            {"North Dakota", "Bismarck"},
            {"Ohio", "Columbus"},
            {"Oklahoma", "Oklahoma City"},
            {"Oregon", "Salem"},
            {"Pennsylvania", "Harrisburg"},
            {"Rhode Island", "Providence"},
            {"South Carolina", "Columbia"},
            {"South Dakota", "Pierre"},
            {"Tennessee", "Nashville"},
            {"Texas", "Austin"},
            {"Utah", "Salt Lake City"},
            {"Vermont", "Montpelier"},
            {"Virginia", "Richmond"},
            {"Washington", "Olympia"},
            {"West Virginia", "Charleston"},
            {"Wisconsin", "Madison"},
            {"Wyoming", "Cheyenne"}
    };

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        // 1. 显示初始州府数据
        System.out.println("--- 初始州府数据 ---");
        displayArray(StateAndCapital);

        // 2. 按首都名称进行冒泡排序
        bubbleSortByCapital(StateAndCapital);

        // 3. 显示排序后的州府数据
        System.out.println("\n--- 按首都名称排序后的州府数据 ---");
        displayArray(StateAndCapital);

        // 4. 进行州府知识问答
        conductQuiz(StateAndCapital, scanner);

        scanner.close(); // 关闭Scanner以释放资源
    }

    // 辅助方法：显示二维数组内容
    public static void displayArray(String[][] data) {
        for (int i = 0; i < data.length; i++) {
            System.out.println(Arrays.toString(data[i]));
        }
    }

    // ... 其他方法将在后续章节实现
}

    // 辅助方法：显示二维数组内容
    public static void displayArray(String[][] data) {
        System.out.println("当前数组内容：");
        for (int i = 0; i < data.length; i++) {
            // Arrays.toString(data[i]) 会将当前行（一个包含州名和首都的字符串数组）转换为易读的字符串形式
            System.out.println(Arrays.toString(data[i]));
        }
    }

    // 辅助方法：按首都名称对二维数组进行冒泡排序
    public static void bubbleSortByCapital(String[][] data) {
        int n = data.length;
        // 外层循环控制排序趟数
        for (int i = 0; i < n - 1; i++) {
            // 内层循环进行比较和交换，每趟结束后最大的元素会“冒泡”到末尾
            for (int j = 0; j < n - 1 - i; j++) {
                // 比较两个相邻行的首都名称（索引为1的列）
                // compareToIgnoreCase() 方法用于不区分大小写的字符串比较
                if (data[j][1].compareToIgnoreCase(data[j + 1][1]) > 0) {
                    // 如果当前行的首都名称在字典序上大于下一行的首都名称，则交换两行
                    // 注意：这里交换的是整个 String[] 行，确保州名和首都保持配对
                    String[] temp = data[j];
                    data[j] = data[j + 1];
                    data[j + 1] = temp;
                }
            }
        }
    }

    // 辅助方法：进行州府知识问答
    public static void conductQuiz(String[][] data, Scanner scanner) {
        int correctCount = 0; // 记录正确答案的数量
        System.out.println("\n--- 州府知识问答开始 ---");

        // 遍历数组中的每个州，向用户提问
        for (int i = 0; i < data.length; i++) {
            String state = data[i][0];       // 当前州名
            String correctCapital = data[i][1]; // 当前州对应的正确首都

            System.out.print("请问 " + state + " 的首都是什么？ ");
            String userAnswer = scanner.nextLine(); // 获取用户输入

            // 验证用户答案：
            // 1. trim() 去除用户输入两端的空格
            // 2. toLowerCase() 将用户输入和正确答案都转为小写，实现不区分大小写的比较
            // 3. equals() 进行字符串内容比较
            if (userAnswer.trim().toLowerCase().equals(correctCapital.toLowerCase())) {
                System.out.println("回答正确！");
                correctCount++; // 答对则计数器加一
            } else {
                System.out.println("回答错误。 " + state + " 的首都是 " + correctCapital + "。");
            }
        }

        System.out.println("\n--- 问答结束 ---");
        System.out.println("您共答对了 " + correctCount + " 题，总共 " + data.length + " 题。");
    }