linearlist1.java

和树类似

package ds_java;
public class LinearList1
{
   private int table[];
   private int n;
public LinearList1()
{
   table=new int[n];
   this.n=0;
}
public boolean isEmpty()
{
   return n==0;
}
public boolean isFull()
{
   return n>=table.length;
}
public int length()
{
   return n;
}
public int get(int i)
{
   if(i>0 && i<=n)
      return table[i-1];
   else
      return -1;
}
public void set(int i,int k)
{
   if(i>0 && i<=n+1)
   {
      table[i-1]=k;
   if(i==n+1)
      n++;
   }
}
public boolean contains(int k)
{
    int j=indexof(k);
    if(j!=-1)
       return true;
    else
       return false;
}
public int indexof(int k)
{
   int j=0;
   while(j<n && table[j]!=k)
         j++;
       if(j>=0 && j<n)
          return j;
       else 
          return -1;
}
public void insert(int i,int k)
{
       int j;
       if(!isFull())
       {
       if(i<=0) i=1;
       if(i>n)
           i=n+1;
          for(j=n-1;j>=i-1;j--)
             table[j+1]=table[j];
             table[i-1]=k;
             n++;
           }
      else
           System.out.println("数组已满，无法插入"+k+"值!");
}
public void insert(int k)
{
     insert(n+1,k);
}
public void remove(int k)
{
    int i=indexof(k);
    if(i!=-1)
     {
       for(int j=i;j<n-1;j++)
          table[j]=table[j+1];
          table[n-1]=0;
          n--;
    }
    else
         System.out.println(k+"值未找到，无法删除!");
}
}