直接排序法
import java. util. Scanner ;
import java. util. Arrays ;
public class ZhiJie {
public static void main ( String [ ] args)
{
Scanner in = new Scanner ( System . in) ;
int n = in. nextInt ( ) ;
int [ ] a = new int [ n] ;
for ( int i= 0 ; i< a. length; i++ )
a[ i] = in. nextInt ( ) ;
pai ( a) ;
output ( a) ;
in. close ( ) ;
}
public static void pai ( int [ ] a)
{ int i, j;
for ( i= 0 ; i< a. length- 1 ; i++ )
{
int min= i, t;
for ( j= i+ 1 ; j< a. length; j++ )
if ( a[ min] > a[ j] )
{
min= j;
}
if ( min!= i)
{ t= a[ i] ; a[ i] = a[ min] ; a[ min] = t; }
}
}
public static void output ( int [ ] a)
{
for ( int i= 0 ; i< a. length; i++ )
System . out. print ( a[ i] + " " ) ;
}
}
基本数据类型输入与输出
import java. util. Scanner ;
public class Geleishuru {
public static void main ( String [ ] args)
{
Scanner in = new Scanner ( System . in) ;
double c = 3.2 ;
int a = in. nextInt ( ) ;
in. nextLine ( ) ;
System . out. println ( “yigeint”) ;
System . out. println ( “yigezifuchuang”) ;
String str = in. nextLine ( ) ;
c = in. nextDouble ( ) ;
System . out. println ( a) ;
System . out. println ( str) ;
System . out. println©;
in. close ( ) ;
}
}
二维数组输入与输出
import java. util. Scanner ;
import java. util. Arrays ;
public class Erweishuzu {
public static void main ( String [ ] args)
{
Scanner in = new Scanner ( System . in) ;
int n, m;
n = in. nextInt ( ) ;
m = in. nextInt ( ) ;
int a[ ] [ ] = new int [ n] [ m] ;
input ( n, m, a) ;
output ( n, m, a) ;
in. close ( ) ;
}
public static void input ( int n, int m, int a[ ] [ ] ) {
Scanner in = new Scanner ( System . in) ;
for ( int i= 0 ; i< n; i++ )
for ( int j= 0 ; j< m; j++ )
a[ i] [ j] = in. nextInt ( ) ;
in. close ( ) ;
}
public static void output ( int n, int m, int a[ ] [ ] )
{
for ( int i= 0 ; i< n; i++ ) {
System . out. println ( Arrays . toString ( a[ i] ) ) ;
}
}
}
统计学生成绩求最大值,最小值,平均值
import java. util. Scanner ;
import java. util. Arrays ;
public class ScoreSum {
static int max, min, average;
public static void main ( String [ ] args) {
Scanner in1 = new Scanner ( System . in) ;
int n = in1. nextInt ( ) ;
int a [ ] = new int [ n] ;
ScoreSum . input ( a) ;
ScoreSum . jisuan ( a) ;
ScoreSum . output ( ) ;
in1. close ( ) ;
}
public static void jisuan ( int a [ ] ) {
max= a[ 0 ] ;
min= a[ 0 ] ;
int t;
for ( int i= 0 ; i< a. length; i++ ) {
average+= a[ i] ;
if ( max< a[ i] ) {
t= a[ i] ; a[ i] = max; max= t;
}
if ( min> a[ i] ) {
t= a[ i] ; a[ i] = min; min= t;
}
}
average/= a. length;
}
public static void output ( ) {
System . out. print ( "max:" + max+ " " + "min:" + min+ " " + "average:" + average) ;
}
public static void input ( int a[ ] ) {
Scanner in2 = new Scanner ( System . in) ;
for ( int i= 0 ; i< a. length; i++ ) {
a[ i] = in2. nextInt ( ) ;
}
in2. close ( ) ;
}
}