class Solution {
public int smallestDifference(int[] a, int[] b) {
Arrays.sort(a);
Arrays.sort(b);
long min = Integer.MAX_VALUE;
int arrp1 = 0, arrp2 = 0;
while(arrp1 < a.length && arrp2 < b.length){
long temp = Math.abs(a[arrp1] - b[arrp2]);
if(temp > 0 && temp < min) min = temp;
if(a[arrp1] < b[arrp2]) arrp1++;
else if(a[arrp1] > b[arrp2]) arrp2++;
else return 0;
}
return (int)min;
}
}
力扣 最小差
最新推荐文章于 2024-07-20 22:34:59 发布