三个递增的整形数组中找到最大的公共元素

代码实现如下：

public class Test {
public static void main(String args[])
{
int[] a = new int[]{3,4,5,6,7,8,9,10,11};
int[] b = new int[]{5,6,7,8,9};
int[] c = new int[]{6,7,8,9,10};
System.out.println(Test.findMaxCommon(a,b,c));

}

public static int findMaxCommon(int[] x,int[] y,int[] z)
{
int i,j,k;
i = x.length-1;
j = y.length-1;
k = z.length-1;
while(i>0 && j>0 && k>0)
{
if(x[i] > y[j]) i--;
else if(y[j] > z[k]) j--;
else if(z[k] > x[i]) k--;
else
{
return x[i];
}//else
}
return -1;
}
}