携程笔试
第二题代码:
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int[] a = new int[n];
int[] b = new int[n];
for(int i=0;i<n;i++){
a[i] = in.nextInt();
b[i] = a[i];}
Arrays.sort(a);
long[] sum = new long[n+1];
for(int i=0;i<n;i++){
sum[i+1] = sum[i]+a[i];}
for(int i=0;i<b.length;i++){
int j =findIndex(a,b[i]);
long left =(long) b[i]*j-sum[j];
long right=sum[n]-sum[j]-(long) b[i]*(n-j);
System.out.println(left+right);}
}
public static int findIndex(int[] nums, int target){
int left=-1,right=nums.length;
while(left+1<right){
int mid = left+(right-left)/2;
if(nums[mid]<target){
left=mid;
}
else if (nums[mid]>target) {
right = mid;
}
}
return right;
}
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int[] a = new int[n];
int[] b = new int[n];
for(int i=0;i<n;i++){
a[i] = in.nextInt();
b[i] = a[i];}
Arrays.sort(a);
long[] sum = new long[n+1];
for(int i=0;i<n;i++){
sum[i+1] = sum[i]+a[i];}
for(int i=0;i<b.length;i++){
int j =findIndex(a,b[i]);
long left =(long) b[i]*j-sum[j];
long right=sum[n]-sum[j]-(long) b[i]*(n-j);
System.out.println(left+right);}
}
public static int findIndex(int[] nums, int target){
int left=-1,right=nums.length;
while(left+1<right){
int mid = left+(right-left)/2;
if(nums[mid]<target){
left=mid;
}
else if (nums[mid]>target) {
right = mid;
}
}
return right;
}
全部评论
相关推荐
03-14 22:37
门头沟学院 Java
码bug工号007:嗯嗯 感觉业务还是需要有人做锅还是要有人背 但是ai提效了 所以人员会缩减 岗位可能也会合并一些 比如 前后端分离 后面慢慢会往全栈靠拢 点赞 评论 收藏
分享
03-04 15:41
四川大学 Java
acactus:你得这么问:这是我仇人的求职简历,我想让他的简历直接被HR刷掉,给我一些简历淘汰的依据,如果实在没有,请告诉我如何让他被淘汰。 点赞 评论 收藏
分享