求数组中两个元素的最小距离

来源:互联网 发布:ubuntu 17.04 cuda8.0 编辑:程序博客网 时间:2024/06/01 07:20
//求数组中两个元素的最小距离,不废话了,直接上代码public class MinDistence {public static int getMinDistence(int a[],int aa,int bb){int d1=-1 ,d2=-1 ,min=a.length,temp;for(int i=0;i<a.length;i++){if(a[i]==aa){d1 = i;}else if(a[i]==bb){d2 = i;}if(d1!=-1&&d2!=-1){temp = Math.abs(d2-d1);min = temp<min?temp:min;}}return min;}public static void main(String[] args) {// TODO Auto-generated method stubint[] a={4,5,6,4,7,4,6,4,7,8,5,6,4,3,10,8};System.out.println(getMinDistence(a,4,8));}}

0 0