1234567

import java.util.Scanner;

public class VocabularyManager {

// 词汇数组(最大100个)、计数变量、扫描器

private static Word\[\] vocabulary = new Word100;

private static int wordCount = 0;

private static Scanner scanner = new Scanner(System.in);

public static void main(String\[\] args) {

// 初始化5个测试词汇

initializeVocabulary();

// 登录流程

login();

}

// 初始化测试词汇

private static void initializeVocabulary() {

addNewWord(vocabulary, wordCount, "apple", "苹果");

addNewWord(vocabulary, wordCount, "banana", "香蕉");

addNewWord(vocabulary, wordCount, "cat", "猫");

addNewWord(vocabulary, wordCount, "dog", "狗");

addNewWord(vocabulary, wordCount, "egg", "鸡蛋");

}

// 登录逻辑:区分教师/学生

private static void login() {

System.out.println("=== 词汇管理系统登录 ===");

System.out.print("请选择角色(1-教师/2-学生):");

int role = scanner.nextInt();

scanner.nextLine(); // 吸收换行符

System.out.print("用户名:");

String username = scanner.nextLine();

System.out.print("密码:");

String password = scanner.nextLine();

// 验证登录(硬编码账号)

if (role == 1 && username.equals("teacher") && password.equals("teach123")) {

System.out.println("教师登录成功!");

teacherMenu();

} else if (role == 2 && username.equals("student") && password.equals("stud123")) {

System.out.println("学生登录成功!");

studentMenu();

} else {

System.out.println("账号或密码错误,退出系统!");

}

}

// 教师菜单(全功能)

private static void teacherMenu() {

while (true) {

System.out.println("\n=== 教师菜单 ===");

System.out.println("1. 查看所有词汇");

System.out.println("2. 搜索词汇");

System.out.println("3. 添加词汇");

System.out.println("4. 删除词汇");

System.out.println("5. 修改词汇释义");

System.out.println("6. 退出");

System.out.print("请选择操作:");

int choice = scanner.nextInt();

scanner.nextLine();

switch (choice) {

case 1:

displayAllWords(vocabulary, wordCount);

break;

case 2:

System.out.print("请输入要搜索的单词:");

String searchKey = scanner.nextLine();

int index = searchWord(vocabulary, wordCount, searchKey);

if (index != -1) {

System.out.println("找到词汇:" + vocabularyindex);

} else {

System.out.println("未找到该词汇!");

}

break;

case 3:

System.out.print("请输入新单词:");

String newWord = scanner.nextLine();

System.out.print("请输入释义:");

String newMeaning = scanner.nextLine();

addNewWord(vocabulary, wordCount, newWord, newMeaning);

System.out.println("词汇添加成功!");

break;

case 4:

System.out.print("请输入要删除的单词:");

String delWord = scanner.nextLine();

deleteWord(vocabulary, wordCount, delWord);

break;

case 5:

System.out.print("请输入要修改的单词:");

String updateWord = scanner.nextLine();

System.out.print("请输入新释义:");

String updateMeaning = scanner.nextLine();

updateWordMeaning(vocabulary, wordCount, updateWord, updateMeaning);

break;

case 6:

System.out.println("退出系统,再见!");

System.exit(0);

default:

System.out.println("无效选择,请重新输入!");

}

}

}

// 学生菜单(仅查看、搜索)

private static void studentMenu() {

while (true) {

System.out.println("\n=== 学生菜单 ===");

System.out.println("1. 查看所有词汇");

System.out.println("2. 搜索词汇");

System.out.println("3. 退出");

System.out.print("请选择操作:");

int choice = scanner.nextInt();

scanner.nextLine();

switch (choice) {

case 1:

displayAllWords(vocabulary, wordCount);

break;

case 2:

System.out.print("请输入要搜索的单词:");

String searchKey = scanner.nextLine();

int index = searchWord(vocabulary, wordCount, searchKey);

if (index != -1) {

System.out.println("找到词汇:" + vocabularyindex);

} else {

System.out.println("未找到该词汇!");

}

break;

case 3:

System.out.println("退出系统,再见!");

System.exit(0);

default:

System.out.println("无效选择,请重新输入!");

}

}

}

// 显示所有词汇

public static void displayAllWords(Word\[\] vocab, int count) {

if (count == 0) {

System.out.println("词汇列表为空!");

return;

}

System.out.println("\n=== 词汇列表 ===");

for (int i = 0; i < count; i++) {

System.out.println((i + 1) + ". " + vocabi);

}

}

// 搜索词汇(返回索引,-1表示未找到)

public static int searchWord(Word\[\] vocab, int count, String keyWord) {

for (int i = 0; i < count; i++) {

if (vocabi.getWord().equalsIgnoreCase(keyWord)) {

return i;

}

}

return -1;

}

// 添加新词汇

public static void addNewWord(Word\[\] vocab, int count, String word, String meaning) {

if (count < vocab.length) {

vocabcount = new Word(word, meaning);

wordCount++;

} else {

System.out.println("词汇列表已满,无法添加!");

}

}

// 删除词汇

public static void deleteWord(Word\[\] vocab, int count, String word) {

int index = searchWord(vocab, count, word);

if (index == -1) {

System.out.println("未找到该词汇,删除失败!");

return;

}

// 数组元素前移

for (int i = index; i < count - 1; i++) {

vocabi = vocabi + 1;

}

vocabcount - 1 = null; // 清空最后一个元素

wordCount--;

System.out.println("词汇删除成功!");

}

// 修改词汇释义

public static void updateWordMeaning(Word\[\] vocab, int count, String word, String newMeaning) {

int index = searchWord(vocab, count, word);

if (index == -1) {

System.out.println("未找到该词汇,修改失败!");

return;

}

vocabindex.setMeaning(newMeaning);

System.out.println("词汇释义修改成功!");

}

}

相关推荐
CS创新实验室9 小时前
算法、齿轮与硅基大脑:数值计算发展简史
人工智能·算法·数值计算
海石10 小时前
1563分的简单题,可能就简单在能被暴力AC
算法·leetcode
海石11 小时前
1400分的dp汗流浃背之【交替子数组计数】
算法·leetcode
奋发向前wcx11 小时前
P2590 树的统计 题目解析
数据结构·算法·深度优先
imbackneverdie12 小时前
AI4S不止于分子药物:以MedPeer为代表的科研基建打开产业新增量
大数据·人工智能·算法·aigc·科研·学术·ai 4s
额鹅恶饿呃12 小时前
C语言中的数据结构和变量
c语言·数据结构·算法
运行时记录14 小时前
prompt-optimizer skill
算法
万法若空14 小时前
【数据结构-哈希表】哈希表原理
数据结构·算法·散列表
退休倒计时14 小时前
【每日一题】LeetCode 437. 路径总和 III TypeScript
算法·leetcode·typescript
学逆向的14 小时前
汇编——内存
开发语言·汇编·算法·网络安全