package cn.bdqn.demo02;
import java.util.Scanner;
public class Lianxi2 {
public static void main(String[] args) {
int a[] = {1,2,3,4,5,6,7,8,9,10};
Scanner sc = new Scanner(System.in);
System.out.println("輸入你加入的數:");
int num = sc.nextInt();
int index = 0;
int newA[]=new int [a.length+1];
for(int i=0;ia[i]){
index = i+1;
}
}
for(int i =newA.length-1;i>index;i--){
newA[i]=newA[i-1];
}
newA[index]=num;
for(int i=0;i



