public int[] invert(int[] ary, int min, int max) // min and max inclusive { int[] ary_all = new int[max - min + 1]; for (int i = min; i <= max; i++) ary_all[i] = i; if (ary == null || ary.length == 0) return ary_all; int total = ary_all.length; for (int i = 0; i < ary.length; i++) { if (ary_all[ary[i] - min] != min - 1) { ary_all[ary[i] - min] = min - 1; total--; } } int[] ary_result = new int[total]; for (int i = ary_all.length - 1; i >= 0; i--) if (ary_all[i] != min - 1) ary_result[--total] = ary_all[i]; return ary_result; }
java.util.Arrays
里面有4各基本函数,equals()来判断两个数组是否相等
{
int[] ary_all = new int[max - min + 1];
for (int i = min; i <= max; i++)
ary_all[i] = i;
if (ary == null || ary.length == 0)
return ary_all; int total = ary_all.length;
for (int i = 0; i < ary.length; i++)
{
if (ary_all[ary[i] - min] != min - 1)
{
ary_all[ary[i] - min] = min - 1;
total--;
}
} int[] ary_result = new int[total];
for (int i = ary_all.length - 1; i >= 0; i--)
if (ary_all[i] != min - 1)
ary_result[--total] = ary_all[i];
return ary_result;
}
}
if(N=={1,3,4,5}){ ...
}to79cy(火焰)
判断两个数组相等"=="就可以了~!~
{
}
else if (java.util.Arrays.equals(ary, new int[]{0, 2})
{
}
满意了吗?
int[] b = new int[]{1, 3, 4, 5};
if (Arrays.equals(N, a))
...
else if (Arrays.equals(N, b))
...
hayai(生命树) ,Diesang(bluecollarLabour) 以及各位!!