Below is an example of a method that could be added to the LinkedIntList class to compute the sum of the list:
public int sum() {
int sum = 0;
ListNode current
= front;
while (current !=
null) {
sum += current.data;
current = current.next;
}
return sum;
}
Queues should be constructed using the Queue<E> interface and the LinkedList<E> implementation. For example, to construct a queue of String values, you would say:
Queue<String>
q = new LinkedList<String>();
Stacks should be constructed using the Stack<E> class (there is no interface). For example, to construct a stack of String values, you would say:
Stack<String>
s = new Stack<String>();
For Stack<E>, you are limited to the following operations (no iterator or foreach loop):
push(value) |
pushes the given value onto the top of the stack |
pop() |
removes and returns the top of the stack |
isEmpty() |
returns true if this stack is empty |
size() |
returns the number of elements in the stack |
For Queue<E>, you are limited to the following operations (no iterator or foreach loop):
add(value) |
adds the given value at the end of the queue |
remove() |
removes and returns the front of the queue |
isEmpty() |
returns true if this queue is empty |
size() |
returns the number of elements in the queue |
hasNext() |
returns true if there are more elements to be read from collection |
next() |
reads and returns the next element from the collection |
remove() |
removes the last element returned by next from the collection |
add(value) |
appends value at end of list |
add(index, value) |
inserts given value at given index, shifting subsequent values right |
add(value) () |
removes all elements of the list |
indexOf(value) |
returns first index where given value is found in list (-1 if not found) |
get(index) |
returns the value at given index |
remove(index) |
removes/returns value at given index, shifting subsequent values left |
set(index, value) |
replaces value at given index with given value |
size() |
returns the number of elements in list |
addAll(collection) |
adds all elements from the given collection to the end of the list |
contains(value) |
returns true if the given value is found somewhere in this list |
remove(value) |
finds and removes the given value from this list |
removeAll(list) |
removes any elements found in the given collection from this list |
iterator() |
returns an object used to examine the contents of the list |
add(value) |
adds the given value to the set |
contains(value) |
returns true if the given value is found in the set |
remove(value) |
removes the given value from the set |
clear() |
removes all elements of the set |
size() |
returns the number of elements in the set |
isEmpty() |
returns true if the set's size is 0 |
addAll(collection) |
adds all elements from the given collection to the set |
containsAll(collection) |
returns true if set contains every element from given collection |
removeAll(collection) |
removes any elements found in the given collection from this set |
retainAll(collection) |
removes any elements not found in the given collection from this set |
iterator() |
returns an object used to examine the contents of the set |
put(key, value) |
adds a mapping from the given key to the given value |
get(key) |
returns the value mapped to the given key (null if none) |
containsKey(key) |
returns true if the map contains a mapping for the given key |
remove(key) |
removes any existing mapping for the given key |
clear() |
removes all key/value pairs from the map |
size() |
returns the number of key/value pairs in the map |
isEmpty() |
returns true if the map's size is 0 |
keySet() |
returns a Set of all keys in the map |
values() |
returns a Collection of all values in the map |
putAll(map) |
adds all key/value pairs from the given map to this map |
Point(x,
y) |
constructs a new point with given x/y coordinates |
Point() |
constructs a new point with coordinates (0, 0) |
getX() |
returns the x-coordinate of this point |
getY() |
returns the y-coordinate of this point |
translate(dx,
dy) |
translates the coordinates by the given amount |
length() |
returns the number of characters in the string |
charAt(index) |
returns thecharacter at a specific index |
compareTo(other) |
returns how this string compares to the other (-1 if less, 0 if equal, 1 if greater) |
equals(other) |
returns true if this string equals the other |
toUpperCase() |
returns a new string with all uppercase letters |
toLowerCase() |
returns a new string with all lowercase letters |
startsWith(other) |
returns true if this string starts with the given text |
substring(start,
stop) |
returns a new string composed of character from start index (inclusive) to stop index (exclusive) |
List<E> |
ArrayList<E> and LinkedList<E> |
Set<E> |
HashSet<E> and TreeSet<E> (values ordered) |
Map<K,
V> |
HashMap<K, V> and TreeMap<K, V> (keys ordered) |