Java經典編程題50道之三十
阿新 • • 發佈:2017-06-06
個數 [] -- ++ 要求 add example system oid }
int[] b = new int[a.length + 1];
int i, j, k;
for (i = 0; i < a.length; i++) {
if (a[i] >= n) {
for (j = a.length; j > i; j--)
b[j] = a[j - 1];
b[i] = n;
break;
} else {
b[a.length] = n;
}
}
for (k = 0; k < i; k++)
b[k] = a[k];
System.out.print("\n插入" + n + "後的數組為:");
for (int r : b) {
System.out.print(r + " ");
}
}
}
有一個已經排好序的數組。現輸入一個數,要求按原來的規律將它插入數組中。
public class Example30 {
public static void main(String[] args) {
int[] m = { 3, 5, 9, 12, 16, 20, 25, 33 };
addElement(m, 17);
}
public static void addElement(int[] a, int n) {
System.out.print("插入前的數組為:");
for (int r : a) {
System.out.print(r + " ");
int[] b = new int[a.length + 1];
int i, j, k;
for (i = 0; i < a.length; i++) {
if (a[i] >= n) {
for (j = a.length; j > i; j--)
b[j] = a[j - 1];
b[i] = n;
break;
} else {
b[a.length] = n;
}
for (k = 0; k < i; k++)
b[k] = a[k];
System.out.print("\n插入" + n + "後的數組為:");
for (int r : b) {
System.out.print(r + " ");
}
}
}
Java經典編程題50道之三十