//找到的最短距离
miniDistance=dist;
//situation(aPointer==aLen&&bPointer==bLen)&&
//situation(aPointer<aLen&&bPointer<bLen) 不存在
if(aPointer==aLen){
while(*(a+aPointer-1)>*(b+bPointer)&&bPointer<bLen){
bPointer++;
}
if(bPointer==bLen){
bPos=bPointer;
miniDistance=*(a+aPointer-1)-*(b+bPointer);
}else{
int latter=*(b+bPointer)-*(a+aPointer-1);
int former=*(a+aPointer-1)-*(b+bPointer-1);
if(latter<former&&latter<dist){
bPos=bPointer;
miniDistance=latter;
}else
