顺序表删除相同元素
day:9.25
方法1
package com.zhongruan;
import java.util.Scanner;
public class DeleteSame {
public static int MaxSize=10;
public static Scanner sc=new Scanner(System.in);
public static void main(String[] args) {
int[]a=new int[MaxSize];
for(int i=0;i<MaxSize;i++)
{
a[i]=sc.nextInt();
}
System.out.println("输入要删除的数");
int delet=sc.nextInt();
int i=0,j=0;
while(i+j<MaxSize)
{
a[i]=a[i+j];
if(a[i]==delet)
j++;
else
i++;
}
MaxSize-=j;
for(int k=0;k<MaxSize;k++)
System.out.print(a[k]+" ");
}
}
方法2
package com.zhongruan;
import java.util.Scanner;
public class DeleteSame2 {
public static int MaxSize=10;
public static Scanner sc=new Scanner(System.in);
public static void main(String[] args) {
int[] a = new int[MaxSize];
for (int i = 0; i < MaxSize; i++) {
a[i] = sc.nextInt();
}
System.out.println("输入要删除的数");
int delet = sc.nextInt();
int i=0,j=MaxSize-1;
while(i<j)
{
if(a[i]==delet)
{
while(i<j&&a[j]==delet)
j--;
if(i<j)
{
a[i]=a[j--];
}
}
i++;
}
for(int k=0;k<j;k++)
System.out.print(a[k]+" ");
}
}