实验4声明圆锥体+求平均值+复数类+随机序列+字符串数组升序

声明圆锥体类

public class K421 {
	public static void main(String[] args) {
		yuanzhuiti yu = new yuanzhuiti(2, 4);
		yuanzhuiti yu2 = new yuanzhuiti(3, 5);
		System.out.println(yu.biaomianji());
		System.out.println(yu.compareTo(yu2));
	}

}

class yuanzhuiti implements Area, Volume, Comparable<yuanzhuiti> {
	double radius;
	double h;

	public yuanzhuiti(double radius, double h) {
		this.radius = radius;
		this.h = h;
	}

	public double biaomianji() {
		return Math.PI * radius * radius + Math.PI * radius
				* Math.sqrt(radius * radius + h * h);
	}

	public double tiji() {
		return Math.PI * radius * radius * h;
	}

	public int compareTo(yuanzhuiti o) {
		int a = this.tiji() > o.tiji() ? 1 : -1;
		return a;
	}

}

interface Area {
	double biaomianji();
}

interface Volume {
	double tiji();
}

求平均值接口与实现该接口的类

import java.util.Scanner;

public class K422 {
	public static void main(String[] args) {
		double[] value = new double[10];
		Scanner sc = new Scanner(System.in);
		for (int i = 0; i < value.length; i++)
			value[i] = sc.nextDouble();
		AverageException av = new AverageException();
		System.out.println(av.averageException(value));
	}

}

interface Averagable {
	double average(double[] value, int n);

	double average(double[] value);
}

class AverageException implements Averagable {

	public double averageException(double[] value) {
		double max = value[0];
		double min = value[0];
		for (int i = 0; i < value.length; i++) {
			if (value[i] > max)
				max = value[i];
			if (value[i] < min)
				min = value[i];
		}
		return (this.average(value) * value.length - min - max) / value.length;

	}

	@Override
	public double average(double[] value, int n) {
		// TODO Auto-generated method stub
		double sum = 0;
		for (int i = 0; i < n; i++)
			sum = sum + value[i];
		// TODO Auto-generated method stub
		return sum / n;
	}

	@Override
	public double average(double[] value) {
		double sum = 0;
		for (int i = 0; i < value.length; i++) {
			sum = sum + value[i];
		}
		// TODO Auto-generated method stub
		return sum / value.length;

	}

}

class AverageAll implements Averagable {
	public double allAverage(double[] value) {
		return this.average(value);
	}

	@Override
	public double average(double[] value, int n) {
		double sum = 0;
		for (int i = 0; i < n; i++)
			sum = sum + value[i];
		// TODO Auto-generated method stub
		return sum / n;
	}

	@Override
	public double average(double[] value) {
		double sum = 0;
		for (int i = 0; i < value.length; i++) {
			sum = sum + value[i];
		}
		// TODO Auto-generated method stub
		return sum / value.length;
	}

}

复数类用接口比较模的大小

public class K423 {
	public static void main(String[] args) {
		Complex co1 = new Complex(2, 5);
		Complex co2 = new Complex(-2, 3);
		System.out.println(co1.getString());
		System.out.println(co1.compareTo(co2));
	}

}

class Complex implements Comparable<Complex> {
	int i;
	int j;
	String fushu;

	public Complex(int i, int j) {
		this.i = i;
		this.j = j;
	}

	public String getString() {
		if (i != 0 && j > 0)
			fushu = i + "i" + "+" + j + "j";
		else if (i != 0 && j < 0)
			fushu = i + "i" + j + "j";
		else if (i != 0 && j == 0)
			fushu = i + "i";
		else if (i == 0 && j != 0)
			fushu = j + "j";
		else
			fushu = "0";
		return fushu;
	}

	@Override
	public int compareTo(Complex o) {
		// TODO Auto-generated method stub
		return (this.i * this.i + this.j * this.j) > (o.i * o.i + o.j * o.j) ? 1
				: -1;
	}
}

产生随机数序列

public class K424 {
	public static void main(String[] args) {
		Integer in[] = Random.randomDifferentSorted(100, 200);
		for (int i = 0; i < in.length; i++)
			System.out.print(in[i] + " ");

	}

}

class Random {
	public static Integer[] random(int n, int max) {
		Integer in[] = new Integer[n];
		for (int i = 0; i < n; i++) {
			in[i] = (int) (max * Math.random());
		}
		return in;
	}

	public static Integer[] randomDifferent(int n, int max) {
		Integer in[] = new Integer[n];
		for (int i = 0; i < n; i++) {
			in[i] = (int) (max * Math.random());
			for (int j = 0; j < i; j++)
				if (in[i] == in[j]) {
					i--;
					break;

				}
		}
		return in;
	}

	public static Integer[] randomSorted(int n, int max) {
		Integer in[] = random(n, max);
		for (int i = 0; i < in.length - 1; i++)
			for (int j = 0; j < in.length - 1 - i; j++) {
				if (in[j] > in[j + 1]) {
					Integer t = in[j];
					in[j] = in[j + 1];
					in[j + 1] = t;
				}
			}
		return in;
	}

	public static Integer[] randomDifferentSorted(int n, int max) {
		Integer in[] = randomDifferent(n, max);
		for (int i = 0; i < in.length - 1; i++)
			for (int j = 0; j < in.length - 1 - i; j++) {
				if (in[j] > in[j + 1]) {
					Integer t = in[j];
					in[j] = in[j + 1];
					in[j + 1] = t;
				}
			}
		return in;

	}
}

保存关键字的字符串数组升序排列

import java.util.Scanner;

public class K425 {
	public static void main(String[] args) {
		String zi[] = { "abstract", "assert", "boolean", "break", "byte", "" };
		for (int i = 0; i < zi.length - 1; i++) {
			for (int j = 0; j < zi.length - 1 - i; j++)
				if (zi[j].compareTo(zi[j + 1]) > 0) {
					String t = zi[j];
					zi[j] = zi[j + 1];
					zi[j + 1] = t;
				}
		}
		for (int i = 0; i < zi.length; i++) {
			System.out.println(zi[i]);
		}
		Scanner sc = new Scanner(System.in);
		String a = sc.next();
		boolean b = true;
		for (int i = 0; i < zi.length; i++) {
			if (zi[i].equals(a)) {
				b = false;
				System.out.println("Yes");
				break;
			}
		}
		if (b)
			System.out.println("NO");
	}

}