linearlist1.java

java的经典example——在java中用链表解决约瑟夫环问题~

public class LinearList1
{
    private int table[];
    private int n;


    public boolean isFull()
    {
        return n >= table.length;
    }


    public LinearList1(int n)
    {
        table = new int[n];
        this.n = 0;
    }

	
	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 void insert(int i,int k) 
    {
        int j;
        if(!isFull())
        {
            if(i<=0) i=1;
            if(i>n) i=n+1;
            for(j=n;j>=i;j--)
                table[j]=table[j-1];
            table[i-1]=k;
            n++;
        }
		else
            System.out.println("数组已满，无法插入"+k+"值！");
    }
    public void insert(int k) 
    {
        insert(n+1,k); 
    }


}