for - java陣列問題

[q738...@yahoo.com.tw]

import java.util.Arrays;
import java.util.Scanner;

public class example {
public static void main(String args[]) {
int a[]={12,46,23,56,88};
System.out.print("目前的陣列");
for (int i : a)
System.out.print(i+" ");

Scanner in = new Scanner(System.in);
System.out.print("\n請輸入所要插入的位置");
int index = in.nextInt();

System.out.print("\n請輸入所要插入的數值");
int number = in.nextInt();
insertion(a,index,number);
for (int k : insertion(a,index,number))
System.out.print(k+" ");
}

public static int[] insertion (int[] ary, int index, int
number) {
int[] newary = new int[ary.length+1];
int i1 = 0;
for (int i=0; i<ary.length; i++) {
if (i == index-1) {
newary[i] = number;
newary[i+1] = ary[i];
i1++;
} else
newary[i1] = ary[i];
i1++;
}
return newary;
}
}

[q738...@yahoo.com.tw]

public class example {
public static void main(String args[]) {

int[] a ={9,4,2,5,8};
int[] b ={2,4,3,6,9};
int[] total = new int[a.length];
for (int i=0; i<a.length; i++) {
total[i] = (a[i] + b[i]);
}

int[] c;
int i;

if (total[0] > 9) {
c = new int[a.length+1];
i=1;
} else {
c = new int[a.length];
i=0;
}

for (; i<c.length; i++) {
if (total[i-1] > 9)
c[i-1] += total[i-1] / 10;
c[i] += total[i-1] % 10;
}

for (int k : c)
System.out.print(k+" ");
}
}