Help with inserting/removing integer from a specific index

Question

I have an IntList that I am adding methods to and an IntListTest driver that allows me to add those options to test. I am having difficulty adding the two methods:
public void removeAt() - removes the value at a specified location at given index with consideration of the size of the list when user enters a valid position
public void insertAt(int index, int newValue) - inserts integer and puts it in the specified index of list however...i also have to take into consideration the size of the list as the user enters a valid position
I started on the insertAt(int index, int newValue) method:
// **Inserts an element to the list at a specified position
public void insertAt(int index, int newValue)
IntNode newnode = new IntNode(newValue, null);
for (int index =0; index < count; index++)
if(list[index] == newValue) //error occurs, brackets pertain to arrays, correct?
//if list is empty, this will be the only node in it
if (list == null)
list = newnode;
else
//temp point directed to the last thing on list, but want to be
//able to insert any where, specified location
IntNode temp = list;
while (temp.next != null)
temp = temp.next;
//link new node into list and insert
temp.next = newnode;
count++;
}First off, how do I write the method so that the user specifies a value at a given index and is located...From what I understand, this portion of the insertAt method is stating that the temp point will go directly to the last index:
//temp point directed to the last thing on list, but want to be
//able to insert any where, specified location
IntNode temp = list;
while (temp.next != null)
temp = temp.next;Here's where I am having complications, because I don't know where to go from here. I want the method to be able to insert at any specified index rather than just the last...I will use the insertAt method as an example for my removeAt method, so hopefully I can get input from anyone willing to help...Thanks - using textpad editor with java 1.5 compiler
Onip28

Answer 1

Thanks for the reply - this is an assignment and I'm dealing with linked structures, I apologize for not specifying that. I have to add a total of six methods to the IntList class (e.g...public int length, String toSting, void removeLast, void search(int input), and the two mentioned - void insertAt(int index, int newValue), and void removeAt(int index)). I figured out the first two, but have had no luck with the remaining one. Here is a sample of that code -
// FILE:  IntList.java
// Purpose: Defines a class that represents a list of integers
//Assignment 3 - methods to fill in, declare any variables where necessary
public class IntList
    private IntNode list;          //first node in list
    private int currentSize;
    public int count;
    String [] elements;
    //  Constructor.  Initially list is empty.
    public IntList()
     list = null;
    //   Adds given integer to list of list.
    public void addToFront(int val)
     list = new IntNode(val,list);
     count++;
    //   Adds given integer to end of list.
    public void addToEnd(int val)
     IntNode newnode = new IntNode(val,null);
     //if list is empty, this will be the only node in it
     if (list == null)
         list = newnode;
     else
          //make temp point to last thing in list
          IntNode temp = list;
          while (temp.next != null)
              temp = temp.next;
          //link new node into list
          temp.next = newnode;
         count++;
    //   Removes the first node from the list.
    //   If the list is empty, does nothing.
    public void removeFirst()
     if (list != null)
         list = list.next;
         count--;
     // **returns the number of elements in the list
     public int length()
          return count;
    // **returns a String containing the print value of the list.
     public String toString()
     StringBuffer result = new StringBuffer("{ ");
                 for (int i=0; i < currentSize; i++) {
                             if (i > 0)
                                 result.append(", ");
                     result.append(elements);
     result.append(" }");
          return result.toString();
     // **removes the last element of the list. If the list is empty, does nothing.
     //public void removeLast()
//Come back to this...
     // **searches all occurrences of a value user enters in the list.
     //public void search(int input)
//Come back to this...
     // **Inserts an element to the list at a specified position
     public void insertAt(int index, int newValue)
     IntNode newnode = new IntNode(newValue, null);
     for (int index =0; index < count; index++)
          if(list[index] == newValue)     //error occurs, brackets pertain to arrays, correct?
//if list is empty, this will be the only node in it
     if (list == null)
     list = newnode;
     else
//temp point directed to the last thing on list, but want to be
//able to insert any where, specified location
     IntNode temp = list;
          while (temp.next != null)
          temp = temp.next;
//link new node into list and insert
          temp.next = newnode;
          count++;
     // **Deletes an element from the list at a specified position
     public void removeAt(int index)
//Come back to this...
// Prints the list elements from first to last.
public void print()
     System.out.println("---------------------");
     System.out.print("List elements: ");
     IntNode temp = list;
     while (temp != null)
          System.out.print(temp.val + " ");
          temp = temp.next;
     System.out.println("\n---------------------\n");
// An inner class that represents a node in the integer list.
// The public variables are accessed by the IntList class.
private class IntNode
     public int val; //value stored in node
     public IntNode next; //link to next node in list
// Constructor; sets up the node given a value and IntNode reference
     public IntNode(int val, IntNode next)
     this.val = val;
     this.next = next;
But as stated, my problem is merely the portion where the the I make adjustments to the "next values" in the associated nodes...
//temp point directed to the last thing on list, but want to be
//able to insert any where, specified location
     IntNode temp = list;
          while (temp.next != null)
              temp = temp.next;I apologize if I am not answering your question correctly but I'm trying to make sense of all this, but need some suggestions/input/advice...Thx.
Regards, Onip28