Java 为位置列表添加方法
我需要为位置列表创建一个add方法。。。它使用数组来存储数据。以下是私有成员和构造函数:Java 为位置列表添加方法,java,arrays,methods,add,Java,Arrays,Methods,Add,我需要为位置列表创建一个add方法。。。它使用数组来存储数据。以下是私有成员和构造函数: private static int DEFAULT_CAPACITY = 10; private Object[] items; private int listSize; private int curPos; private int lastItemPos; public FSAPositionalList(){ items = new Object[DEFAULT_CAPACITY]; listS
private static int DEFAULT_CAPACITY = 10;
private Object[] items;
private int listSize;
private int curPos;
private int lastItemPos;
public FSAPositionalList(){
items = new Object[DEFAULT_CAPACITY];
listSize= 0;
curPos = 0;
lastItemPos = -1;
}
我编写的方法的Psuedo代码为:
一,。检查阵列OOB。
2.从当前位置->列表末尾创建临时数组
3.在当前位置添加项目
4.从curPos+1开始从临时数组重新添加项
以下是我当前的方法代码:
public void add(Object obj){
// Check For Out of Bounds
if(listSize+1 > DEFAULT_CAPACITY){
throw new RuntimeException("Too many items.");
}else{
//if first time then otherwise
if(listSize == 0){
System.out.println("Permission Granted");
items[curPos] = obj;
listSize++;
return;
}
System.out.println("Access");
// Create temp array from curPos --> end
Object temp[] = new Object[listSize-curPos];
//populate temp array
int counter = 0;
for(int i = curPos; i<listSize; i++){
temp[counter] = items[i];
System.out.print("Temp - " + temp[counter]);
counter++;
}
System.out.println();
// Insert obj
items[curPos] = obj;
System.out.println(" Temp Array: ");
for(int i = 0; i < temp.length; i++){
System.out.println(temp[i]);
}
// re-add temparray after obj
int c = 0;
for(int i = curPos+1; i<listSize; i ++){
System.out.println("Replacing " + i + " " + items[i] + " with " + temp[c]);
items[i] = temp[c];
c++;
}
listSize++;
}
我得到了以下输出:
Adding 1
Permission Granted
List : 1
Adding 2
Access
Temp - 1
Temp Array:
1
List : 2 null
Adding 3
Access
Temp - 2Temp - null
Temp Array:
2
null
Replacing 1 null with 2
List : 3 2 null
Adding 66
Access
Temp - 2Temp - null
Temp Array:
2
null
Replacing 2 null with 2
List : 3 66 2 null
3 66 2 null
我不知道为什么它不会将临时数组1重新添加到后面的单词列表中。有人能帮忙吗?如果有人在寻找,可以找到更好的解决方案:
if (isFull())
throw new RuntimeException("The list is full");
for (int i = listSize - 1; i >= curPos; i--) //Open a space in
items[i + 1] = items[i]; //the array
items[curPos] = obj; //and insert obj in this space
lastItemPos = -1; //Block remove and set until after a successful
//next or previous
listSize++;
if (isFull())
throw new RuntimeException("The list is full");
for (int i = listSize - 1; i >= curPos; i--) //Open a space in
items[i + 1] = items[i]; //the array
items[curPos] = obj; //and insert obj in this space
lastItemPos = -1; //Block remove and set until after a successful
//next or previous
listSize++;