麟哥面试所遇到的三道题目！

备注：如技术无止尽，方法可能不好不对，恳请指出并加以改进，只求上进，^_^

第一道：

//在一个元素不重复的int数组里，再加入了一个它们中的一员，要求找出重复的那个数字

private static int findSameNumber(int[] array){

int sum = 0;

int result = 0;

Collection collections = new HashSet();

for (int i = 0; i < array.length; i++) {

int temp = array[i];

sum = sum + 1;

System.out.println("sum:" + sum);

collections.add(temp);

System.out.println("collections:" + collections.size());

if (sum != collections.size()) {

result = temp;

break;

}

}

return result;

}

第二道：

//找出两个整数的最大公约数

private static int findMaxNumber(int oneNum,int twoNum){

if(oneNum != twoNum){

int maxNum = Math.max(oneNum, twoNum);

int minNum =Math.min(oneNum, twoNum);

int remainder = maxNum%minNum;

if (remainder == 0) {

return minNum;

}

for (;remainder!=0;remainder = maxNum%minNum) {

maxNum = minNum;

minNum = remainder;

}

return minNum;

}else{

return oneNum;

}

}

第三道：

//冒泡排序,从大到小

private static int[] arraySort(int[] array){

for (int i = 0; i < array.length; i++) {

for (int j = 0; j < array.length-i-1; j++) {

if (array[j] < array[j+1]){

int temp = array[j];

array[j] = array[j+1];

array[j+1] = temp;

}

}

}

return array;

}

测试代码：

public static void main(String[] args) {

System.out.println(ArrayTest.findSameNumber(new int[]{1,8,7,3,2,8}));

System.out.println(ArrayTest.findMaxNumber(32, 12));

int[] array = ArrayTest.arraySort(new int[]{1,3,2,5,8});

for (int i = 0; i < array.length; i++) {

System.out.print(array[i]);

}

}