/*例一:在线性表的第i-1各数据元素和第i各数据元素之间插入一个新的数据元素,是线性表的长度增加一个元素的空间。使线性表的
长度增加一个元素的空间*/
/*例二,顺序存储结构中,删除线性表的第i个数据元素,使线性表的长度减少一个元素的空间。*/
长度增加一个元素的空间*/
public
class
arrayinsert
{
public static void main(String[] args)
{
int array[];
if (i > array.length - 1 && i < 0 )
{
System.out.println( " i not exist " );
}
else
{
for ( int k = narray.length - 1 ;k <= i;k -- )
{
narray[k + 1 ] = narray[k];
narray[i] = item;
}
}
narray.length = narray.length + 1 ;
}
}
{
public static void main(String[] args)
{
int array[];
if (i > array.length - 1 && i < 0 )
{
System.out.println( " i not exist " );
}
else
{
for ( int k = narray.length - 1 ;k <= i;k -- )
{
narray[k + 1 ] = narray[k];
narray[i] = item;
}
}
narray.length = narray.length + 1 ;
}
}
/*例二,顺序存储结构中,删除线性表的第i个数据元素,使线性表的长度减少一个元素的空间。*/
public
class
arraydelete
{
public static void main(String[] args)
{
int narray[];
if (i > array.length && i < 0 )
{
System.out.println( " i not exist " );
}
else if (narray.length == 0 ) // 如果当前数据个数为0,否则就要溢出了
{
System.out.println( " overflow " );
}
else
{
for ( int k = i; k < narray.length - 1 ;k ++ )
{
narray[k] = narray[k + 1 ];
}
}
narray.length = narray.length - 1 ;
}
}
{
public static void main(String[] args)
{
int narray[];
if (i > array.length && i < 0 )
{
System.out.println( " i not exist " );
}
else if (narray.length == 0 ) // 如果当前数据个数为0,否则就要溢出了
{
System.out.println( " overflow " );
}
else
{
for ( int k = i; k < narray.length - 1 ;k ++ )
{
narray[k] = narray[k + 1 ];
}
}
narray.length = narray.length - 1 ;
}
}
/*例三,显示顺序存储的线性表的所有元素*/
public
void
print()
{
if (isempty())
{
system.out.print( " () " ); // 如果当前线性表为空,则显示()
}
else
{
System.out.println( " ( " );
for ( int i = 0 ;i <= narry.length - 1 ;i ++ )
{
system.out.print(narray[i] + " " );
}
System.out.println( " ) " );
}
}
{
if (isempty())
{
system.out.print( " () " ); // 如果当前线性表为空,则显示()
}
else
{
System.out.println( " ( " );
for ( int i = 0 ;i <= narry.length - 1 ;i ++ )
{
system.out.print(narray[i] + " " );
}
System.out.println( " ) " );
}
}