携程笔试
第二题代码:
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;
}
全部评论 
 相关推荐
 点赞 评论 收藏   
分享
 10-29 22:30
  吉林大学 Java  喵喵喵6_6:应该哪里不对吧,大厂都是20k以上的,10k那种对于985本的学生基本就是点击一下过了笔试就送的 ,我前两天刚拿了一个11k,笔试完第2天就打电话了,非科班。坏消息是c++岗开这么低真是刷新认知了
,我前两天刚拿了一个11k,笔试完第2天就打电话了,非科班。坏消息是c++岗开这么低真是刷新认知了
 点赞 评论 收藏   
分享
 
 查看9道真题和解析
查看9道真题和解析