Question

JAVA (implementing a collection class) write a completed program using ArrayIntList and Client

last occurrence of that value, or -1 if the value is not found in the list. For example, if the list stores [1, 18, 2, 40 1, then the last index of 18 is 6 and the last index of 3 is -1 7, 18, 39, 18, 2. Write a method called indexofsubList that accepts another list L as a parameter and returns the starting index of where L first appears in this list, or -I if it is not found. All elements of L must appear in sequence and in the same order. For example, if variables called listl and list2 store [11, -7, 3, 42, 0, 14] and (3, 42, 01, respectively, the call of listl.indexofsubList(list2) should return 2.

ArrayIntList.java

public class ArrayIntList {

private int[] elementData; // list of integers

private int size; // current number of elements in the list

public static final int DEFAULT_CAPACITY = 100;

// pre : capacity >= 0

// post: constructs an empty list with the given capacity

public ArrayIntList(int capacity) {

elementData = new int[capacity];

size = 0;

}

// post: constructs an empty list of default capacity

public ArrayIntList() {

this(DEFAULT_CAPACITY);

}

// post: returns the current number of elements in the list

public int size() {

return size;

}

// pre : 0 <= index < size()

// post: returns the integer at the given index in the list

public int get(int index) {

return elementData[index];

}

// post: creates a comma-separated, bracketed version of the list

public String toString() {

if (size == 0) {

return "[]";

} else {

String result = "[" + elementData[0];

for (int i = 1; i < size; i++) {

result += ", " + elementData[i];

}

result += "]";

return result;

}

}

// post : returns the position of the first occurrence of the given

// value (-1 if not found)

public int indexOf(int value) {

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

if (elementData[i] == value) {

return i;

}

}

return -1;

}

// pre : size() < capacity

// post: appends the given value to the end of the list

public void add(int value) {

elementData[size] = value;

size++;

}

// pre: size() < capacity && 0 <= index <= size()

// post: inserts the given value at the given index, shifting

subsequent

// values right

public void add(int index, int value) {

for (int i = size; i > index; i--) {

elementData[i] = elementData[i - 1];

}

elementData[index] = value;

size++;

}

// pre : 0 <= index < size()

// post: removes value at the given index, shifting subsequent values

left

public void remove(int index) {

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

elementData[i] = elementData[i + 1];

}

size--;

}

}

Client.java

public class Client {

public static void main(String[] args) {

// construct and print list

int[] data = {13, 4, 85, 13, 40, -8, 17, -5};

ArrayIntList list = new ArrayIntList();

for (int n : data) {

list.add(n);

}

System.out.println("list = " + list);

// obtain an iterator to find the product of the list

ArrayIntListIterator i = new ArrayIntListIterator(list);

int product = 1;

while (i.hasNext()) {

int n = i.next();

product *= n;

}

System.out.println("product = " + product);

}

}

Answer 1

If you have any doubts, please give me comment...

public class ArrayIntList {

private int[] elementData; // list of integers

private int size; // current number of elements in the list

public static final int DEFAULT_CAPACITY = 100;

// pre : capacity >= 0

// post: constructs an empty list with the given capacity

public ArrayIntList(int capacity) {

elementData = new int[capacity];

size = 0;

}

// post: constructs an empty list of default capacity

public ArrayIntList() {

this(DEFAULT_CAPACITY);

}

// post: returns the current number of elements in the list

public int size() {

return size;

}

// pre : 0 <= index < size()

// post: returns the integer at the given index in the list

public int get(int index) {

return elementData[index];

}

// post: creates a comma-separated, bracketed version of the list

public String toString() {

if (size == 0) {

return "[]";

} else {

String result = "[" + elementData[0];

for (int i = 1; i < size; i++) {

result += ", " + elementData[i];

}

result += "]";

return result;

}

}

// post : returns the position of the first occurrence of the given

// value (-1 if not found)

public int indexOf(int value) {

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

if (elementData[i] == value) {

return i;

}

}

return -1;

}

// pre : size() < capacity

// post: appends the given value to the end of the list

public void add(int value) {

elementData[size] = value;

size++;

}

// pre: size() < capacity && 0 <= index <= size()

// post: inserts the given value at the given index, shifting subsequent

// values right

public void add(int index, int value) {

for (int i = size; i > index; i--) {

elementData[i] = elementData[i - 1];

}

elementData[index] = value;

size++;

}

// pre : 0 <= index < size()

// post: removes value at the given index, shifting subsequent values left

public void remove(int index) {

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

elementData[i] = elementData[i + 1];

}

size--;

}

public int indexOfSubList(ArrayIntList list) {

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

if (get(i) == list.get(0)) {

boolean isOk = true;

for (int j = 1; j < list.size(); j++) {

if (get(i + j) != list.get(j))

isOk = false;

}

if (isOk)

return i;

}

}

return -1;

}

}

public class Client {

public static void main(String[] args) {

// construct and print list

int[] data = {11, -7, 3, 42, 0, 14};

ArrayIntList list = new ArrayIntList();

for (int n : data) {

list.add(n);

}

int[] data2 = {3, 42, 0};

ArrayIntList list2 = new ArrayIntList();

for(int n: data2){

list2.add(n);

}

System.out.println("list = " + list);

System.out.println("list2 = " + list2);

System.out.println(list.indexOfSubList(list2));

}

}