第八次Java作业

1.0

package dibazhou;

public class diyici {

/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
int a[]=new int[]{10,20,30,40,50};
for (int i = 0; i < a.length; i++) {
System.out.println(a[i]);
}
}

}

 

 2.

package dibazhou;

public class dierici {

/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
String d[]=new String[]{"g","o","u"};
String o[]=new String[]{"s","h","a"," "," "," "};
System.arraycopy(d, 0, o, 3, 3);
for (int i = 0; i < o.length; i++) {
System.out.print(o[i]);
}
}

}

 

 3.

package dibazhou;

public class disanci {

/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
int a[] = new int []{1,6,2,3,9,4,5,7,8};
for (int i = 0; i < a.length-1; i++) {
for (int j = 0; j < a.length-1-i; j++) {
if (a[j]<a[j+1]) {
int c;
c = a[j];
a[j] = a[j+1];
a[j+1] = c;
}
}
}
System.out.print("排列后的数组为");
for (int i = 0; i < a.length; i++) {

System.out.print(a[i]);
}
}

}

 

 4.

package dibazhou;

public class disici {

/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub

double d[][] = new double [][]{{1,5},{2,7},{5,0},{1,0},{1,1}};
for (int i = 0; i < d.length; i++) {
for (int j = 0; j < d[i].length; j++) {
System.out.print(+d[i][j]+" ");
}
System.out.println();
}
}

}

 

 5.

package dibazhou;

public class diwuci {

/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
int a[] = new int[]{18,25,7,36,13,2,89,63};
int max = a[0];
int d=0;
int maxindex = 0;
for (int i = 1; i < a.length; i++) {
if (max<a[i]) {
d=a[i];
a[i] = max;
max = d;
maxindex = i;
}
}
System.out.println("最大值为："+max+"最大值下标为："+maxindex); }
}

 

 6.

package dibazhou;

public class diliuci {

/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub

int a[] = new int []{1,2,6,4,3,0,5,7,8,9};
int c;
for (int i = 0; i < a.length-1; i++) {
for (int j = 0; j < a.length-1; j++) {
if (a[j]>a[j+1]){
c = a[j];
a[j] = a[j+1];
a[j+1] = c;
}
}
}
for (int i = 0; i < a.length; i++) {
System.out.print(a[i]);
}

}

}

 

7.

package dibazhou;

public class diqici {

/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub

int a[] = new int []{5,2,0,5,2,4,1,9};
for (int i = 0; i < a.length-1; i++) {
for (int j = i+1; j < a.length; j++) {
if(a[i]==a[j]&&i!=j) {
a[j] = 0;
}
}

}
for (int i = 0; i < a.length; i++) {
System.out.print(a[i]+" ");
}

}

}

 

 

 8.

package dibazhou;

public class dibaci {

/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
int a[] = new int []{ -10,2,3,246,-100,0,5};
int sum = 0;
int pingjun = 0;
int zuida = a[0];
int zuixia = a[0];
int d=0;
for (int i = 0; i < a.length-1; i++) {
sum = sum+a[i];
}
pingjun = sum/a.length;
for (int i = 1; i < a.length; i++) {
if (zuida<a[i]) {
d = a[i];
a[i] = zuida;
zuida = d;
}
}
for (int i = 1; i < a.length; i++) {
if (zuixia>a[i]) {
d = a[i];
a[i] = zuixia;
zuixia = d;
}
}
System.out.println("数组中的最大值为："+zuida);
System.out.println("数组中最小值为："+zuixia);
System.out.println("数组中平均值为："+pingjun);
}

}

 

 9.

package dibazhou;

public class dijiuti {

/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
int a[] = new int [20];
a[0] = 1;
a[1] = 1;
for (int i = 2; i < a.length; i++) {
a[i] = a[i-1]+a[i-2];
}
for (int i = 0; i < a.length; i++) {
System.out.print(a[i]+" ");
}
}

}

 

 10.

package dibazhou;

import java.util.Random;

public class dishici {

/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub

Random b = new Random();
int a[] = new int [10];
for (int i = 0; i < a.length; i++) {
int c = b.nextInt(101);
a[i] = c;
}
for (int i = 0; i < a.length-1; i++) {
for (int j = 0; j < a.length-1-i; j++) {
if (a[i]>a[j]) {
int d = 0;
d = a[i];
a[i] = a[j];
a[j] = d;
}
}
}
for (int i = 0; i < a.length; i++) {
System.out.print(a[i]+" ");
}
}
}