64 lines
1.4 KiB
Java
64 lines
1.4 KiB
Java
|
|
/**
|
|
* Beschreiben Sie hier die Klasse List.
|
|
*
|
|
* @author (Ihr Name)
|
|
* @version (eine Versionsnummer oder ein Datum)
|
|
*/
|
|
public class List<T>
|
|
{
|
|
private Node<T> first;
|
|
public List(){ //leere liste soll erzeugt werden, wert wird zugedingst
|
|
first = null;
|
|
}
|
|
public boolean isEmpty(){
|
|
if (first == null)return true;
|
|
return false;
|
|
}
|
|
public int size(){
|
|
Node<T> current = first;
|
|
int count = 0;
|
|
while (current != null){
|
|
count++;
|
|
current = current.next;
|
|
}
|
|
return count;
|
|
}
|
|
public T get(int n){
|
|
Node<T> current = first;
|
|
for(int i = 0; i<n; i++){
|
|
if (current == null) return null;
|
|
current = current.next;
|
|
}
|
|
if (current == null) return null;
|
|
return current.wert;
|
|
}
|
|
public void add(T val){
|
|
Node<T> neu = new Node<T>();
|
|
neu.wert = val;
|
|
|
|
if (first ==null){
|
|
first = neu;
|
|
}else{
|
|
Node<T> current = first;
|
|
while (current.next !=null){
|
|
current = current.next;
|
|
}
|
|
current.next = neu;
|
|
}
|
|
}
|
|
public void add(int n, T val){
|
|
|
|
}
|
|
public boolean contains(T val){
|
|
Node<T> current = first;
|
|
while (current != null){
|
|
if (current.wert.equals(val)) return true;
|
|
}
|
|
return false;
|
|
}
|
|
public T remove(int n){
|
|
|
|
}
|
|
}
|