import java.util.*;
import java.util.text;

public interface List {

     //Appends the specified element to the end of this list and returns the specific position at which it was added.
     public int add(Object o){
                 if (head == null){
                     head = new Node (o, null);
                     count++;
                 }
                 else
                 
                 Node current = head;
                 while (current.link != null){
                     current = current.link;
                 }
                 current.link = new Node (o, null);
                 count++;
     }
          
     //Inserts the specified element at the specified position in this list.
     public void add(int index, Object o){
         if (head == null){
                     head = new Node (o, null);
                     count++;
                 }
                 else
                 
                 Node current = head;
                 while (current.link != null){
                     current = current.link;
                 }
                 current.link = new Node (o, null);
                 count++;
     }
         
     }
          
     //Removes all of the elements from this list.
     public void clear(){
     }
    
    
          
     //Returns true if this list contains the specified element.
     public boolean contains(Object element){
                           return false;
     }
         
     //Compares the specified object with this list for equality.
     public boolean equals(Object element){
                           return false;
     }
          
     //Returns the element at the specified position in this list.
     public Object get(int index){
                             return info;
     }
          
     //Returns the index in this list of the first occurrence of the specified element, or -1 if this list does not contain this element.
     public int indexOf(Object element){
     }
    
          
     //Returns true if this list contains no elements.
     public boolean    isEmpty(){
         if (head == null)
                           return false;
     }
          
     //Removes the element at the specified position in this list.
     public Object    remove(int index){
                          if (move == n) {
                   move = n.getNext();
               }
               else {
                 Node tmp = move;
               while (tmp.getNext() != n) tmp = tmp.getNext();
               tmp.setNext( n.getNext() );
      }
              
      
          
     //Replaces the element at the specified position in this list with the specified element.
     public Object    set(int index, Object o){
                             return null;
     }
          
     //Returns the number of elements in this list.
     public int    size(){
                     return -1;
     }
          
     //Returns an array containing all of the elements in this list in proper sequence
     public Object[]    toArray(){
                     return null;
     }
    
     // Returns a String representation of the list.
       public String toString()
        {
        String result = "";
        NumListNode current = NumListNode;
        while (current != null)
          {    
            result += current.numbers + "\n";
            current = current.next;
          }
          return result;

    
}
    

public interface myInterface
{
    int getInteger();
    String whoseYourDaddy(int NameIndex);
}

public class myClass implements myInterface
{
    public int getInteger() //implements the method defined in myInterface
    {
        return 43;
    }

    public String whoseYourDaddy(int NameIndex) //implements the other method in myInterface
    {
         return Names[NameIndex];
    }

    public myClass() //a contructor
    {
          //...
    }

    public void doNothing()
    {
        //a random method
    }

    String[] Names;
}

//Removes the element at the specified position in this list.
     public Object    remove(int index){
                          if (move == n) { // n and move are undefined this will break your program, im also going to assume that 'move'is going to be the node after 'n' which presumably is the node at position 'index'
                   move = n.getNext();
               }
               else {
                 Node tmp = move;
               while (tmp.getNext() != n) tmp = tmp.getNext();// youve assigned tmp to be the node after 'n' already so all this will do is search through the remainder of the List and then throw an Exception, i think what you were trying to do was find the node before 'n'? so try assigning tmp to 'head' instead of 'move' and go from there.
               tmp.setNext( n.getNext() ); //this line will work but if my earlier assumptions are correct saying [i]tmp.setnext(move);[/i] would be more efficient
      }

return n;