public class NumberCollection { private int[] numberArray; private int count; pu
ID: 3550915 • Letter: P
Question
public class NumberCollection
{
private int[] numberArray;
private int count;
public NumberCollection(int arraySize)
{
numberArray = new int[arraySize];
count = 0;
}
private int indexOf(int searchingNum)
{
for(int i = 0;i<numberArray.length;i++)
{
if(searchingNum == numberArray[i2])
{
return i;
}
}
return i-1;
}
public boolean addNumber(int numberToAdd)
{
if(indexOf(numberToAdd)== -1 || indexOf(0)!= -1)
{
cout++;
numberArray[indexOf(0)]= numberToAdd;
return true;
}
else if(indexOf(numberToAdd)==-1||indexOf(0)==-1)
{
count++;
this.doubleArrayCapacity();
numberArray[indexOf(0)]= numberToAdd;
return true;
}
else
{
return false;
}
}
private void doubleArrayCapacity()
{
int[] tempArray = new int[(numberArray.length)*2];
for(int i=0;i<numberArray.length;i++)
{
tempArray[i]=numberArray[i];
}
numberArray = new int[tempArray.length];
for(int j=0;j<numberArray.length;j++)
{
numberArray[j]=tempArray[j];
}
}
public int findMax()
{
int heavy = numberArray[0];
for(int i=0;i<numberArray.length;i++)
{
if(numberArray[i]>heavy)
{
heavy = numberArray[i];
}
}
return heavy;
}
public int findMin()
{
int min = numberArray[0];
for(int i=0;i<numberArray.length;i++)
{
if(numberArray[i]<min)
{
min = numberArray[i];
}
}
return min;
}
public boolean removeNumber(int numberToRemove)
{
if(indexOf(numberToRemove)> -1)
{
numberArray[indexOf(numberToRemove)]= numberArray[(numberArray.length)-1];
numberArray[(numberArray.length)-1]= 0;
return true;
}
else
{
return false;
}
}
public String toString()
{
String string="";
for(int i=0;i<numberArray.length;i++)
{
string = "" +numberArray[i];
}
return string;
}
public int computeSum()
{
int sum = 0;
}
for(int j=0;j<numberArray.length;j++)
{
sum += numberArray[j];
}
return sum;
}
}
Explanation / Answer
package com.steves.chegg.java;
public class NumberCollection{
private int[] numberArray;
private int count;
public NumberCollection(int arraySize)
{
numberArray = new int[arraySize];
count = 0;
}
private int indexOf(int searchingNum) {
int returnVal=-1;
for (int i = 0; i < numberArray.length; i++) {
if (searchingNum == numberArray[i]) {
returnVal= i;
}
}
return returnVal;
}
public boolean addNumber(int numberToAdd)
{
if (indexOf(numberToAdd) == -1 || indexOf(0) != -1)
{
count++;
numberArray[indexOf(0)] = numberToAdd;
return true;
}
else if (indexOf(numberToAdd) == -1 || indexOf(0) == -1)
{
count++;
this.doubleArrayCapacity();
numberArray[indexOf(0)] = numberToAdd;
return true;
}
else
{
return false;
}
}
private void doubleArrayCapacity()
{
int[] tempArray = new int[(numberArray.length) * 2];
for (int i = 0; i < numberArray.length; i++)
{
tempArray[i] = numberArray[i];
}
numberArray = new int[tempArray.length];
for (int j = 0; j < numberArray.length; j++)
{
numberArray[j] = tempArray[j];
}
}
public int findMax()
{
int heavy = numberArray[0];
for (int i = 0; i < numberArray.length; i++)
{
if (numberArray[i] > heavy)
{
heavy = numberArray[i];
}
}
return heavy;
}
public int findMin()
{
int min = numberArray[0];
for (int i = 0; i < numberArray.length; i++)
{
if (numberArray[i] < min)
{
min = numberArray[i];
}
}
return min;
}
public boolean removeNumber(int numberToRemove)
{
if (indexOf(numberToRemove) > -1)
{
numberArray[indexOf(numberToRemove)] = numberArray[(numberArray.length) - 1];
numberArray[(numberArray.length) - 1] = 0;
return true;
}
else
{
return false;
}
}
public String toString()
{
String string = "";
for (int i = 0; i < numberArray.length; i++)
{
string = "" + numberArray[i];
}
return string;
}
public int computeSum()
{
int sum = 0;
for (int j = 0; j < numberArray.length; j++)
{
sum += numberArray[j];
}
return sum;
}
}
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.