m-n之间分别用数组显示能被2整除和不能被2整除的数,用二维数组怎么实现?
class C//将m--n之间能被2整除的和不能被2整除的分成2个数组显示
{
int a[],b[];
C(int m,int n)
{
a = new int[n+1];
b = new int[n+1];
for(int i=m;i<=n;i++)
{
if(i%2==0)
{
a[i] = i;
System.out.println(m+"---"+n+" m%2==0 "+a[i]);
}
else
{
b[i] = i;
System.out.println(m+"---"+n+" m%2!=0 "+b[i]);
}
}
}
public static void main(String args[])
{
new C(3,99);
}
}