携程笔试
第二题代码:
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;
}
全部评论
相关推荐
2025-12-19 19:02
西安交通大学 Java
程序员牛肉:双九,而且还是西交这种比较好的985九没必要再投日常了。你投中小厂,人家会觉得你学历这么顶还面试肯定是海投的,过了你也不去。所以不约你了。
直接准备暑期实习就好,现在你可以面试。但是目的不再是去日常实习了,而是熟悉面试节奏。
后续把精力放到八股,算法和AI知识上。抽空把自己这两个项目换了,怎么选项目可以看看我主页写的文章。
你学历不错的,不要焦虑 点赞 评论 收藏
分享

