课程融合之线性表
- 定义一个类MyArrayList，用数组模拟实现数据结构中线性表的基本功能，该类中最少包含的属性有：data（String[]）、size（int）、CAPACITY（int）;
- 该类中方法最少包括线性表的初始化、插入查找、遍历线性表、删除、返回线性表长度、线性表判空、清空线性表、替换、获取元素、判断线性表中是否包含某个元素、反向查找、末尾插入元素；
- 定义一个主类，在主方法中创建线性表类对象并调用上述方法、完成功能演示。
1. Main类
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
System.out.println("初始化数组:");
Array array = new Array();
array.work();
while(true){
int choice = array.menu();
array.doMyArrayList(choice, array);
System.out.println("请输入0或1:(0 -->> 退出程序 1 -->> 继续操作)");
Scanner scan = new Scanner(System.in);
if ((choice = scan.nextInt()) == 0){
return;
}
}
}
}
2. 接口及接口的实现
2.1 接口类:
interface MyArrayList {
void work(Array array);
}
2.2 功能类
2.2.1 数组的初始化(内置了菜单)
import java.util.Arrays;
import java.util.Scanner;
public class Array {
double[] array = new double[10];
private int data;
private int size = 10;
private int CAPACITY ;
public int getData() {
return data;
}
public int getSize() {
return size;
}
public void setData(int data) {
this.data = data;
}
public int getCAPACITY() {
return CAPACITY;
}
public void setCAPACITY(int CAPACITY) {
this.CAPACITY = CAPACITY;
}
MyArrayList[] myarraylist = new MyArrayList[11];
public void work(){
System.out.println("请输入你要初始化的元素个数:");
Scanner scan = new Scanner(System.in);
CAPACITY = scan.nextInt();
System.out.println("请输入元素:");
for(int i = 0; i < CAPACITY; i++){
array[i] = scan.nextDouble();
}
}
{
myarraylist[0] = new Find();
myarraylist[1] = new Insert();
myarraylist[2] = new Print();
myarraylist[3] = new Delent();
myarraylist[4] = new Long();
myarraylist[5] = new IsEmpty();
myarraylist[6] = new Empty();
myarraylist[7] = new Change();
myarraylist[8] = new get();
myarraylist[9] = new IsHave();
myarraylist[10] = new Reverse();
}
public int menu(){
System.out.println("hello 欢迎来到数组小练习");
System.out.println("--------------------------------");
System.out.println("0. 查找元素");
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.println("7. 替换元素");
System.out.println("8. 获取元素");
System.out.println("9. 判断线性表中是否包含某个元素");
System.out.println("10. 反向查找");
System.out.println("--------------------------------");
System.out.println("请输入要完成的功能编号");
Scanner scan = new Scanner(System.in);
int choice = scan.nextInt();
return choice;
}
@Override
public String toString() {
return "Array{" +
"array=" + Arrays.toString(array) +
'}';
}
public void doMyArrayList(int choice, Array array){
myarraylist[choice].work(array);
}
}
2.2.2 更改数组元素
import java.util.Scanner;
public class Change implements MyArrayList{
@Override
public void work(Array array) {
Scanner scan = new Scanner(System.in);
System.out.println("请输入要置换的的元素个数:");
int n = scan.nextInt();
for(int i = 0; i < n; i++){
System.out.println("请输入要置换的元素下标:(一次只能置换一个元素)");
int sub = scan.nextInt();
if (sub < array.getCAPACITY()){
System.out.println("请输入置换后的数字:");
array.array[sub] = scan.nextDouble();
System.out.println("置换成功");
}else{
System.out.println("输入错误,该数组中没有该下标");
}
}
}
}
2.2.3 数组元素的删除
import java.util.Scanner;
public class Delent implements MyArrayList{
@Override
public void work(Array array) {
System.out.println("请输入要删除的元素个数:");
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
if (n < array.getCAPACITY()){
for(int i = 0; i < n; i++){
System.out.println("请输入要删除的元素下标:");
int sub = scan.nextInt();
if (sub == array.getCAPACITY() - 1){
array.array[sub] = 0;
array.setCAPACITY(array.getCAPACITY() - 1);
}else{
while(sub < array.getCAPACITY()){
array.array[sub] = array.array[sub + 1];
sub++;
}
array.setCAPACITY(array.getCAPACITY() - 1);
}
}
System.out.println("删除成功");
}else{
System.out.println("删除失败,该数组中没有该下标");
}
}
}
2.2.4 清空数组
public class Empty implements MyArrayList{
@Override
public void work(Array array) {
if (array == null){
System.out.println("数组已经为空,不必清空");
}else{
for (int i = 0; i < array.getCAPACITY(); i++){
array.array[i] = 0;
}
array.setCAPACITY(0);
System.out.println("清空成功");
}
}
}
2.2.5 查找元素
import java.util.Scanner;
public class Find implements MyArrayList{
@Override
public void work(Array array) {
System.out.println("请输入要查找的元素个数:");
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
if (n <= array.getCAPACITY()){
for(int i = 0; i < n; i++){
System.out.println("请输入要查找的元素:(一次只能查找一个元素)");
double a = scan.nextDouble();
for (int j = 0 ; j < array.getCAPACITY(); j++){
if (array.array[j] == a){
System.out.println("查找成功,该元素下标为" + j);
break;
}
}
if (i == array.getCAPACITY()){
System.out.println("查找失败,没有该元素");
}
}
}else{
System.out.println("输入错误,该线性表中只有" + array.getCAPACITY() + "个元素");
}
}
}
2.2.6 获取元素
import java.util.Scanner;
public class get implements MyArrayList{
@Override
public void work(Array array) {
System.out.println("请输入要获取的元素个数:");
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
if (n <= array.getCAPACITY()){
for(int i = 0; i < n; i++){
System.out.println("请输入要获取的元素下标:(一次只能获取一个元素)");
System.out.println("获取成功,该元素为" + array.array[scan.nextInt()]);
}
}else{
System.out.println("获取错误,该线性表中只有" + array.getCAPACITY() + "个元素");
}
}
}
2.2.7 插入元素
import java.util.Scanner;
public class Insert implements MyArrayList{
@Override
public void work(Array array) {
System.out.println("请输入要插入的元素个数:");
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
for (int i = 0 ; i < n; i++){
System.out.println("请输入要插入的元素在线性表中的下标");
int q = scan.nextInt();
if (q > array.getCAPACITY() + 1){
System.out.println("插入失败,下标数字过大,最大应从" + array.getCAPACITY() + "处开始插入");
}else{
if(array.getCAPACITY() <= array.getSize()){
if (q == array.getCAPACITY()){
array.setCAPACITY(array.getCAPACITY() + 1);
System.out.println("请输入要插入的元素");
array.array[q] = scan.nextDouble();
}else{
array.setCAPACITY(array.getCAPACITY() + 1);
for (int j = q; j < array.getCAPACITY(); j++){
array.array[q + 1] = array.array[q];
}
System.out.println("请输入要插入的元素");
array.array[q] = scan.nextDouble();
}
}else{
System.out.println("插入失败,该线性表最多可以有" + array.getSize() + "个元素");
System.out.println("当前已有" + array.getSize() + "个元素");
}
}
}
}
}
2.2.8 判断是否为空
public class IsEmpty implements MyArrayList{
@Override
public void work(Array array) {
if(array.getCAPACITY() == 0 || array == null){
System.out.println("该线性表为空");
}else{
System.out.println("该线性表不为空");
}
}
}
2.2.9 判断线性表中是否包含某元素
import java.util.Scanner;
public class Find implements MyArrayList{
@Override
public void work(Array array) {
System.out.println("请输入要查找的元素个数:");
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
if (n <= array.getCAPACITY()){
for(int i = 0; i < n; i++){
System.out.println("请输入要查找的元素:(一次只能查找一个元素)");
double a = scan.nextDouble();
for (int j = 0 ; j < array.getCAPACITY(); j++){
if (array.array[j] == a){
System.out.println("查找成功,该元素下标为" + j);
break;
}
}
if (i == array.getCAPACITY()){
System.out.println("查找失败,没有该元素");
}
}
}else{
System.out.println("输入错误,该线性表中只有" + array.getCAPACITY() + "个元素");
}
}
}
2.2.10 查询线性表当下长度
public class Long implements MyArrayList{
@Override
public void work(Array array) {
if(array == null){
System.out.println("该线性表为空");
}else{
System.out.println("该线性表长度为" + array.getCAPACITY());
}
}
}
2.2.11 打印线性表
public class Print implements MyArrayList{
@Override
public void work(Array array) {
System.out.println(array);
}
}
2.2.12 反向查找
import java.util.Scanner;
public class Reverse implements MyArrayList{
@Override
public void work(Array array) {
System.out.println("请输入要查找的元素个数:");
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
if (scan.nextInt() <= array.getCAPACITY()){
for(int i = 0; i < n; i++){
System.out.println("请输入要查找的元素:(一次只能查找一个元素)");
double a = scan.nextDouble();
for (int j = array.getCAPACITY() - 1 ; j >= 0; j--){
if (array.array[i] == a){
System.out.println("查找成功,该元素下标为" + j);
}
}
System.out.println("查找失败,该数组中没有该元素");
}
}else{
System.out.println("输入错误,该线性表中只有" + array.getCAPACITY() + "个元素");
}
}
}
3. 运行结果
448
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
