![在这里插入图片描述](https://img-blog.csdnimg.cn/f226dc8f8fc1458a92c3cdccda19c7eb.png)
第一次代码测试:
import java.util.Scanner;
import java.util.Arrays;
public class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int n=scan.nextInt();
int a[]=new int[n];
int min=0,max=0,c=0;
for(int i=0;i<n;i++)
a[i]=scan.nextInt();
int b[]=Arrays.copyOfRange(a,0,a.length);
Arrays.sort(b);
for(int i=0;i<n;i++)
{
if(b[n/2]>b[i])
min++;
if(b[n/2]<b[i])
max++;
}
for(int i=0;i<n;i++)
{
if(a[i]<b[n/2])
c=b[n/2]-a[i]+1;
else if(min<max && a[i]==b[n/2])
c=b[n/2]-a[i]+1;
else
c=0;
System.out.print(c);
System.out.print(" ");
}
scan.close();
}
}
运行结果:![在这里插入图片描述](https://img-blog.csdnimg.cn/fd5df9f498d34777aaa4819c8a6a5211.png)
第二次完整代码:
import java.util.Scanner;
import java.util.Arrays;
public class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int n=scan.nextInt();
int a[]=new int[n];
int min=0,max=0,c=0;
for(int i=0;i<n;i++)
a[i]=scan.nextInt();
int b[]=Arrays.copyOfRange(a,0,a.length);
Arrays.sort(b);
for(int i=0;i<n;i++)
{
if(b[n/2]>b[i])
min++;
if(b[n/2]<b[i])
max++;
}
for(int i=0;i<n;i++)
{
if(a[i]<b[n/2]&&max>=min)
c=b[n/2]-a[i]+1;
else if(a[i]<b[n/2]&&max<min)
c=b[n/2]-a[i];
else if(min<max && a[i]==b[n/2])
c=b[n/2]-a[i]+1;
else
c=0;
System.out.print(c);
System.out.print(" ");
}
scan.close();
}
}
运行结果:
![在这里插入图片描述](https://img-blog.csdnimg.cn/1ecf05f0bbb746abbf88850ba2daed3f.png)