某外企 机试题

如果数组中存在这样的数，这个数比它左边的所有的数大，并且比它右边的所有的数小，返回它的索引；如果不存在，返回-1。
例如：int[] arr = {5,3,6,2,7,10,8,12}; 7比它左边的数都大，比它右边的数都小，所以返回4

 

我的解答

我也写了一个，貌似很复杂，只是我想正好学习JAVA，当做练习，熟悉些特性吧
其实核心就是getIndices，这个方法返回所有符合条件的Index,
思想是先找到所有大于左边所有的数的那些数
再找到所有小于右边所有的数的那些数
两个条件都符合的，就是我们要找的
如果只需要第一个，取返回数组的第一个就OK了
没找到符合条件的时候，就返回-1

import java.util.*; class FindIndexAux { int value; boolean isGreaterThanBefore; boolean isLessThanAfter; public FindIndexAux(int i, boolean gtb, boolean lta) { value = i; isGreaterThanBefore = gtb; isLessThanAfter = lta; } public boolean greaterThan(FindIndexAux o) { return (value > o.value); } public boolean lessThan(FindIndexAux o) { return (value < o.value); } } class FindIndex { public static Integer[] getIndices(int... args) { FindIndexAux[] fi = new FindIndexAux[args.length]; //初始化 for (int index = 0; index < args.length; index++) { fi[index] = new FindIndexAux(args[index],false,false); } //在以下查找过程中，默认第一个和最后一个都是无效的 //先正向查找，标识所有大于左边的对象； FindIndexAux max=fi[0]; for (int index = 1; index < fi.length-1; index++) { if (fi[index].greaterThan(max)) { max = fi[index]; fi[index].isGreaterThanBefore = true; } } //再反向查找，标识所有小于右边的对象； FindIndexAux min=fi[fi.length - 1]; for (int index = fi.length-2; index > 0; index--) { if (fi[index].lessThan(min)) { min = fi[index]; fi[index].isLessThanAfter = true; } } //最后遍历所有对象，查找isGreaterThanBefore、isLessThanAfter都为true的，就是要找的 ArrayList<Integer> ial = new ArrayList<Integer>(); for (int index = 1; index < fi.length-1; index++) { if (fi[index].isGreaterThanBefore && fi[index].isLessThanAfter) ial.add(index); } if (ial.size() > 0) return ial.toArray(new Integer[1]); else return (new Integer[]{-1}); } public static Integer[] getIndicesAnother(int... args) { boolean[] nGreaterThanBefore = new boolean[args.length]; boolean[] nLessThanAfter = new boolean[args.length]; //初始化 for (int index = 0; index < args.length; index++) { nGreaterThanBefore[index] = false; nLessThanAfter[index] = false; } //在以下查找过程中，默认第一个和最后一个都是无效的 //先正向查找，标识所有大于左边的对象； int max=args[0]; for (int index = 1; index < args.length-1; index++) { if (args[index] > max) { max = args[index]; nGreaterThanBefore[index] = true; } } //再反向查找，标识所有小于右边的对象； int min=args[args.length - 1]; for (int index = args.length-2; index > 0; index--) { if (args[index]<min) { min = args[index]; nLessThanAfter[index] = true; } } //最后遍历所有对象，查找isGreaterThanBefore、isLessThanAfter都为true的，就是要找的 ArrayList<Integer> ial = new ArrayList<Integer>(); for (int index = 1; index < args.length-1; index++) { if (nGreaterThanBefore[index] && nLessThanAfter[index]) ial.add(index); } if (ial.size() > 0) return ial.toArray(new Integer[1]); else return (new Integer[]{-1}); } public static void main(String[] args) { Integer[] indices = getIndices(new int[]{5,3,6,9,7,10,5,12}); System.out.println("getIndices(new int[]{5,3,6,9,7,10,5,12}):"); if (indices.length == 1) System.out.println(indices[0]); else System.out.println(Arrays.toString(indices)); indices = getIndices(new int[]{5,3,6,2,7,10,8,12}); System.out.println("getIndices(new int[]{5,3,6,2,7,10,8,12}):"); if (indices.length == 1) System.out.println(indices[0]); else System.out.println(Arrays.toString(indices)); indices = getIndices(new int[]{5,3,6,9,7,10,8,12}); System.out.println("getIndices(new int[]{5,3,6,9,7,10,8,12}):"); if (indices.length == 1) System.out.println(indices[0]); else System.out.println(Arrays.toString(indices)); indices = getIndices(5,3,6,2,7,10,5,12); System.out.println("getIndices(5,3,6,2,7,10,5,12):"); if (indices.length == 1) System.out.println(indices[0]); else System.out.println(Arrays.toString(indices)); indices = getIndices(3,4,5,6,7,8,9,10); System.out.println("getIndices(3,4,5,6,7,8,9,10):"); if (indices.length == 1) System.out.println(indices[0]); else System.out.println(Arrays.toString(indices)); indices = getIndices(3,4,7,13,10,15,17,16); System.out.println("getIndices(3,4,7,13,10,15,17,16):"); if (indices.length == 1) System.out.println(indices[0]); else System.out.println(Arrays.toString(indices)); indices = getIndicesAnother(new int[]{5,3,6,9,7,10,5,12}); System.out.println("getIndicesAnother(new int[]{5,3,6,9,7,10,5,12}):"); if (indices.length == 1) System.out.println(indices[0]); else System.out.println(Arrays.toString(indices)); indices = getIndicesAnother(new int[]{5,3,6,2,7,10,8,12}); System.out.println("getIndicesAnother(new int[]{5,3,6,2,7,10,8,12}):"); if (indices.length == 1) System.out.println(indices[0]); else System.out.println(Arrays.toString(indices)); indices = getIndicesAnother(new int[]{5,3,6,9,7,10,8,12}); System.out.println("getIndicesAnother(new int[]{5,3,6,9,7,10,8,12}):"); if (indices.length == 1) System.out.println(indices[0]); else System.out.println(Arrays.toString(indices)); indices = getIndicesAnother(5,3,6,2,7,10,5,12); System.out.println("getIndicesAnother(5,3,6,2,7,10,5,12):"); if (indices.length == 1) System.out.println(indices[0]); else System.out.println(Arrays.toString(indices)); indices = getIndicesAnother(3,4,5,6,7,8,9,10); System.out.println("getIndicesAnother(3,4,5,6,7,8,9,10):"); if (indices.length == 1) System.out.println(indices[0]); else System.out.println(Arrays.toString(indices)); indices = getIndicesAnother(3,4,7,13,10,15,17,16); System.out.println("getIndicesAnother(3,4,7,13,10,15,17,16):"); if (indices.length == 1) System.out.println(indices[0]); else System.out.println(Arrays.toString(indices)); } }

 

运行结果

getIndices(new int[]{5,3,6,9,7,10,5,12}):
-1
getIndices(new int[]{5,3,6,2,7,10,8,12}):
4
getIndices(new int[]{5,3,6,9,7,10,8,12}):
2
getIndices(5,3,6,2,7,10,5,12):
-1
getIndices(3,4,5,6,7,8,9,10):
[1, 2, 3, 4, 5, 6]
getIndices(3,4,7,13,10,15,17,16):
[1, 2, 5]
getIndicesAnother(new int[]{5,3,6,9,7,10,5,12}):
-1
getIndicesAnother(new int[]{5,3,6,2,7,10,8,12}):
4
getIndicesAnother(new int[]{5,3,6,9,7,10,8,12}):
2
getIndicesAnother(5,3,6,2,7,10,5,12):
-1
getIndicesAnother(3,4,5,6,7,8,9,10):
[1, 2, 3, 4, 5, 6]
getIndicesAnother(3,4,7,13,10,15,17,16):
[1, 2, 5]

 

更多，请参见：http://topic.csdn.net/u/20090525/17/06b40494-020a-4fdc-bfbf-4118e2465442.html?seed=882665728