向数组中插入元素算法

import java.util.Scanner;

public class 向数组中插入元素算法 {

public static void main(String[] args) {
	Scanner s = new Scanner(System.in);
	
	System.out.println("输入数组长度:");
	int m = s.nextInt();
	int[] a = new int[m];
	
	System.out.println("输入数组元素:");
	for(int i = 0; i < a.length-2; i++)
	{
		a[i] = s.nextInt();
	}
	
	System.out.println("输入被插入数:");
	int b = s.nextInt();
	
	int size = m-2;//记录数组的大小
	
	int index = 0; //用于记录插入位置的索引
	
	for(int i = 0; i < a.length; i++)
	{//遍历数组
		if(b < a[i])
		{
			index = i;
			break;
		}
	}
	
	for(int i = size; i > index; i-- )
	{
		a[i] = a[i-1];
	}
	
	a[index] = b;
	
	for(int i = 0; i<a.length-2 ; i++)
	{
		System.out.println(a[i]);
	}
}

}

猜你喜欢

转载自blog.csdn.net/Austin_/article/details/90142988