问是否有办法使这个主类反向方法更有效？可能只需要一个循环？

EN

  //code inside a reverse method that has the list object 
  //passed as a parameter from main method
  int size = list.size();
  //create temporary list object to hold contents of original list in reverse
  MyListReferenceBased temp = new MyListReferenceBased(); 
  for (int i = 0; i < size; i++) 
  { 
    //list add method requires which index your adding to, and object
    //get method just gets the object at the specified index in list
    temp.add(i, list.get((size-i)-1)); 
    //remove method just removes object at specified index
    list.remove((size-i)-1);                       
  } 
  //now that original list is empty, put the contents back in 
  for (int i = 0; i<size; i++)
  { 
    list.add(i, temp.get(i));            
  } 
  temp.removeAll(); 
  //end result: original list is now reversed 
  //and temporary array is all empty 
  System.out.println("List has been Reversed."); 
  //is there a way to get rid of the 2nd loop?? Not possible to just assign?

public class MyListReferenceBased implements ListInterface { 

    private Node head; 

    public MyListReferenceBased() 
    {
        head = null;
    }  
    
    public boolean isEmpty() {
        return head == null;
    }

    
    // dont use find()
    public int size() {
        int size = 0;
       
        Node curr = head;
        while (curr != null) {
            curr = curr.getNext(); 
            size++;
        }
    
        return size;
    }

    private Node find (int index) 
    {
        Node curr = head;
        for (int skip = 0; skip < index; skip++) 
        {
            curr = curr.getNext();
        } // end for
        return curr;
    } // end find
    
    public void add(int index, Object item)
                  throws ListIndexOutOfBoundsException 
    {
        if (index >= 0 && index < size() + 1) 
        {
            if (index == 0) 
            {
                // insert the new node containing item at
                // beginning of list
                Node newNode = new Node(item, head);
                head = newNode;
            } 
            else 
            {
                Node prev = find(index-1);
            
                Node newNode = new Node(item, prev.getNext());
                prev.setNext(newNode);
            } // end if
        } 
        else 
        {
            throw new ListIndexOutOfBoundsException(
                          "List index out of bounds exception on add");
        } // end if
    }  // end add
    
        
    public Object get(int index) 
      throws ListIndexOutOfBoundsException 
    {
        if (index >= 0 && index < size()) 
        {
            Node curr = find(index);
            Object dataItem = curr.getItem();
            return dataItem;
        }
        else 
        {
            throw new ListIndexOutOfBoundsException(
                "List index out of bounds exception on get");
        } // end if
    } // end get
    
    public void remove(int index) 
      throws ListIndexOutOfBoundsException 
    {
        if (index >= 0 && index < size()) 
        {
            if (index == 0) 
            {
                head = head.getNext();
            } 
            else 
            {
                Node prev = find(index-1);
                Node curr = prev.getNext(); 
                prev.setNext(curr.getNext());
            } // end if
        } 
        else 
        {
            throw new ListIndexOutOfBoundsException(
                "List index out of bounds exception on remove");
        } // end if
    }   // end remove

    public void removeAll() {
        head = null;
    }
   
    
    public String toString() {
        String x = "";
        
        Node curr = head; 
        int size = size();
        for (int i = 0; i < size ; i++) {
           // curr.getNext(); 
            x += curr.getItem() + " "; 
            curr = curr.getNext(); 
        } 
        return x;
    }
}

public class Node 
{
  private Object item;
  private Node next;

  public Node(Object newItem) 
  {
    item = newItem;
    next = null;
  } // end constructor

  public Node(Object newItem, Node nextNode) 
  {
    item = newItem;
    next = nextNode;
  } // end constructor

  public void setItem(Object newItem) 
  {
    item = newItem;
  } // end setItem

  public Object getItem() 
  {
    return item;
  } // end getItem

  public void setNext(Node nextNode) 
  {
    next = nextNode;
  } // end setNext

  public Node getNext() 
  {
    return next;
  } // end getNext
} // end class Node