Answered step by step
Verified Expert Solution
Question
1 Approved Answer
Complete a StringList class that will behave like ArrayList but will only store String objects. Code structure below. public class StringList { /** * TODO:
Complete a StringList class that will behave like ArrayList but will only store String objects.
Code structure below.
public class StringList { | |
/** | |
* TODO: Declare private data members including an array of String. | |
*/ | |
/** | |
* Construct a new StringList with a default size of 10. | |
*/ | |
public StringList() { | |
//TODO: Complete constructor. | |
} | |
/** | |
* Construct a new StringList with size provided by the parameter. | |
* @param size | |
*/ | |
public StringList(int size) { | |
//TODO: Complete constructor. | |
} | |
//TODO: Consider one or more private helper methods. | |
/** | |
* Add the new item to the end of the list. | |
* | |
* If the array is full it will be resized. | |
* | |
* Return true if successful and false otherwise. | |
* @param item | |
* @return | |
*/ | |
public boolean add(String item) { | |
//TODO: Replace with your code. | |
return false; | |
} | |
/** | |
* Add a new item at the given position. | |
* | |
* If the position is out of range, return false. | |
* Otherwise, insert the item in the specified position | |
* and return true to indicate success. | |
* | |
* If the array is full it will be resized. | |
* @param item | |
* @param position | |
* @return | |
*/ | |
public boolean add(String item, int position) { | |
//TODO: Replace with your code. | |
return false; | |
} | |
/** | |
* Remove the item at the position specified. Make sure to | |
* shift all other items up to ensure no "empty" spaces in the | |
* array. | |
* | |
* If position is out of range, return null. Otherwise, return | |
* the item removed. | |
* | |
* @param position | |
* @return | |
*/ | |
public String remove(int position) { | |
//TODO: Replace with your code; | |
return null; | |
} | |
/** | |
* Remove the first instance of item. Make sure to | |
* shift all other items up to ensure no "empty" spaces in the | |
* array. | |
* | |
* If the item does not appear in the array return false, otherwise | |
* return true. | |
* | |
* @param position | |
* @return | |
*/ | |
public boolean remove(String item) { | |
//TODO: Replace with your code. | |
return false; | |
} | |
/** | |
* Return true if the array contains item and false otherwise. | |
* | |
* @param item | |
* @return | |
*/ | |
public boolean contains(String item) { | |
//TODO: Replace with your code. | |
return false; | |
} | |
/** | |
* Return the number of valid items in the array. | |
* | |
* @return | |
*/ | |
public int size() { | |
//TODO: Replace with your code. | |
return -1; | |
} | |
/** | |
* Return true if the list is empty and false otherwise. | |
* @return | |
*/ | |
public boolean isEmpty() { | |
//TODO: Replace with your code. | |
return false; | |
} | |
/** | |
* Return the item at position index. | |
* | |
* If index is out of range, return null. | |
* | |
* @param index | |
* @return | |
*/ | |
public String get(int index) { | |
//TODO: Replace with your code. | |
return null; | |
} | |
/** | |
* Return the String that comes first alphabetically. | |
* | |
* If the list is empty, return null. | |
* | |
* @return | |
*/ | |
public String smallest() { | |
//TODO: Replace with your code. | |
return null; | |
} | |
/** | |
* Return the String that comes last alphabetically. | |
* | |
* If the list is empty, return null. | |
* | |
* @return | |
*/ | |
public String largest() { | |
//TODO: Replace with your code. | |
return null; | |
} | |
/** | |
* Return the index of the given item. | |
* | |
* If the item does not exist, return -1; | |
* | |
* @param item | |
* @return | |
*/ | |
public int indexOf(String item) { | |
//TODO: Replace with your code. | |
return -1; | |
} | |
/** | |
* Return the last index of the given item. | |
* | |
* If the item appears more than once you will return | |
* the index where it appears last. | |
* | |
* If the item does not exist in the array return -1; | |
* @param item | |
* @return | |
*/ | |
public int lastIndexOf(String item) { | |
//TODO: Replace with your code. | |
return -1; | |
} | |
/** | |
* Return a String representation of the array. | |
* | |
* A newline ( ) character will be appended after each String. | |
* | |
* ["a", "b", null] would be translated to the following String: | |
* "a b " | |
* | |
* If the list is empty return the empty string. | |
* | |
*/ | |
public String toString() { | |
//TODO: Replace with your code. | |
return null; | |
} | |
/** | |
* Return an array of String that contains all items that appear multiple | |
* times in the array data member. | |
* | |
* If an item appears more than once in the original it will appear only | |
* once in the result. | |
* | |
* | |
* Example 1: ["a", "b", "c"] -> [] | |
* Example 2: ["a", "a", "c"] -> ["a"] | |
* Example 2: ["a", "b", "a", "a", "b"] -> ["a", "b"] | |
* | |
* @return | |
*/ | |
public String[] duplicates() { | |
//TODO: Replace with your code. | |
return null; | |
} | |
} |
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started