蓝桥杯算法训练-排序-题解（C语言代码）

解题思路:
硬核写法 傻瓜式 绝对看懂
注意事项:

参考代码:

import java.util.Scanner;

public class Test1 {

/**

* @param args

*/

public static void main(String[] args) {

// TODO Auto-generated method stub

     Scanner scanner=new Scanner(System.in);

      int a=scanner.nextInt();

      int b=scanner.nextInt();

      int c=scanner.nextInt();

      int max=0;

      int zj=0;

      int min = 0;

  if (a>b&&a>c) {

max=a;

if(b>c){

zj=b;

min=c;

}

if(c>b){

zj=c;

min=b;

}

System.out.println(max+" "+zj+" "+min);

return;

    }

  if(b>a&&b>c){

max=b;

if(a>c){

zj=a;

min=c;

}

if(c>a){

zj=c;

min=a;

}

System.out.println(max+" "+zj+" "+min);

return;

  }

  if (c>a&&c>b) {

max=c;

if (a>b) {

zj=a;

min=b;

}

else {

zj=b;

min=a;

}

}

  System.out.println(max+" "+zj+" "+min);

  return;

  }

}