面向对象编程代码java

Ⅰ java面向对象编程求帮忙

一共三个类：ScoreArray.java、StudentScoreArray.java和Test1.java，具体为：

public class ScoreArray {
private int[] scores;
private int scoreCount;

public int[] getScores() {
return scores;
}

public int getScoreCount() {
return scoreCount;
}
//构造函数
public ScoreArray(int[] scores) {
this.scores = scores;
for (int score : scores) {
if (score >= 0 && score <= 100) {
this.scoreCount++;
}
}
}
//求最大值
public int getMax() {
int[] scores = this.scores;
int temp;
for (int i = 0; i < scores.length; i++) {
for (int j = 0; j < scores.length - 1 - i; j++) {
if (scores[j] > scores[j + 1]) {
temp = scores[j];
scores[j] = scores[j + 1];
scores[j + 1] = temp;
}
}
}
return scores[scores.length - 1];
}
//求最小值
public int getMin() {
int[] scores = this.scores;
int temp;
for (int i = 0; i < scores.length; i++) {
for (int j = 0; j < scores.length - 1 - i; j++) {
if (scores[j] > scores[j + 1]) {
temp = scores[j];
scores[j] = scores[j + 1];
scores[j + 1] = temp;
}
}
}
return scores[0];
}
//求均值
public double getAvg() {
int sum = 0;
for (int score : this.scores) {
sum += score;
}
return new BigDecimal(sum).divide(
new BigDecimal(this.scores.length),
2, BigDecimal.ROUND_HALF_UP).doubleValue();
}
//排序
public void sort() {
int temp;
for (int i = 0; i < this.scores.length; i++) {
for (int j = 0; j < this.scores.length - 1 - i; j++) {
if (this.scores[j] > this.scores[j + 1]) {
temp = this.scores[j];
this.scores[j] = this.scores[j + 1];
this.scores[j + 1] = temp;
}
}
}
}
//静态说明类
public static void explain() {
System.out.println("本类[ScoreArray]实现了数组的：求最值[getMax()]、求均值[getAvg()]和排序[sort()]方法");
}
}

public class StudentScoreArray extends ScoreArray {
public StudentScoreArray(int[] scores) {
super(scores);
}
//统计
public void statistic() {
super.sort();
Map<Integer, Integer> map = new LinkedHashMap<>();
for (int i : super.getScores()) {
if (map.containsKey(i)) {
map.put(i, map.get(i) + 1);
} else {
map.put(i, 1);
}
}
map.forEach((k, v) -> System.out.println("分数为[" + k + "]的人数为：[" + v + "]"));
}
//静态说明类
public static void explain() {
System.out.println("本类[StudentScoreArray]实现了数组的：求最值[getMax()]、求均值[getAvg()]、排序[sort()]和分布统计[statistic()]方法");
}
}

public class Test1 {
public static void main(String[] args) {
int[] scores = {59, 60, 82, 58, 71, 99, 0, 59, 65};

ScoreArray scoreArray = new ScoreArray(scores);
ScoreArray.explain();
System.out.print("数组内容：[");
for (int i : scoreArray.getScores()) {
System.out.print(i + " ");
}
System.out.println("]");
System.out.println("有效值个数：" + scoreArray.getScoreCount());
System.out.println("最大值：" + scoreArray.getMax());
System.out.println("最小值：" + scoreArray.getMin());
System.out.println("平均值：" + scoreArray.getAvg());
scoreArray.sort();
System.out.print("排序后数组内容：[");
for (int i : scoreArray.getScores()) {
System.out.print(i + " ");
}
System.out.println("]");

System.out.println("");
System.out.println("========华丽的分割线========");
System.out.println("");

StudentScoreArray studentScoreArray = new StudentScoreArray(scores);
StudentScoreArray.explain();
System.out.print("数组内容：[");
for (int i : studentScoreArray.getScores()) {
System.out.print(i + ",");
}
System.out.println("]");
System.out.println("有效值个数：" + studentScoreArray.getScoreCount());
System.out.println("最大值：" + studentScoreArray.getMax());
System.out.println("最小值：" + studentScoreArray.getMin());
System.out.println("平均值：" + studentScoreArray.getAvg());
studentScoreArray.sort();
System.out.print("排序后数组内容：[");
for (int i : studentScoreArray.getScores()) {
System.out.print(i + " ");
}
System.out.println("]");
System.out.println("分数分布统计:");
studentScoreArray.statistic();
}
}

其中对StudentScoreArray类我要特别说明一下：

统计分布情况时，使用了Map，map是一种key-value的数据结构，其有个特点被我所利用：一个map中只能同时存在一个key，所以我以分数为key，以数量为value，遍历分数数组时，如果是第一次遇到这个key（分数），则将其value（数量）置为1；如果已经不是第一次遇见了，则将其value（数量）置为value + 1（数量 + 1）。另外需要遍历这个map实现统计结果的打印，我这里使用了java8以后才支持的Lambda表达式，所以你要运行这个程序必须要使用jdk1.8以上的版本。如果你觉得这样不妥，可以网上再搜一下map的遍历方式。

运行结果：

测试用例都使用的数组：int[] scores = {59, 60, 82, 58, 71, 99, 0, 59, 65};

Ⅱ JAVA璇瑷 閲囩敤闱㈠悜瀵硅薄绋嫔簭璁捐℃濇兂缂栧啓绋嫔簭璁＄畻 n!,瑕佹眰浣跨敤鎺ュ彛 鍜屾娊璞＄被瀹炵幇銆傛ユ眰鍏ㄩ儴浠ｇ爜

/**
*
*阒朵箻璁＄畻鍣
*
*鎺ュ彛
*/
publicinterfaceFactorialImp{
//璁＄畻阒朵箻n!镄勫
longfactorial(intn);
}

/**
*
*阒朵箻璁＄畻鍣
*
*鎶借薄绫缁ф圹FactorialImp
*/
{
/**
*瀹炵幇璁＄畻阒朵箻n!镄勫肩殑鏂规硶
*/
publiclongfactorial(intn){
returnmultiplicationCount(n,n-1);
}

/**
*澧炲姞鎶借薄鏂规硶--璁＄畻涓ゆ暟鐩镐箻
*
*@paramparam1Int
*@paramparam2Int
*@return涓ゆ暟鐩镐箻镄勭Н
*/
(longparam1Int,longparam2Int);

}


/**
*瀹炵幇阒朵箻璁＄畻鍣ㄧ被
*
*/
{


@Override
longmultiplicationCount(longparam1Int,longparam2Int){
if(param2Int==1){
returnparam1Int;
}else{
returnmultiplicationCount(param1Int*param2Int,param2Int-1);
}

}

}

/**
*娴嬭瘯绫
*
*/
publicclassTest{

publicstaticvoidmain(String[]args){
FatoriallocalFatorial=newFatorial();
System.out.println("100!="+localFatorial.factorial(10));
}

}

Ⅲ java面向对象编程题目

public class Rectangle
{
private double width;
private double height;

//无参构造器
public Rectangle()
{}
//有参构造器
public Rectangle(double width, double height)
{
this.width = width;
this.height = height;
}
//属性的get和set方法定义
public void setWidth(double width)
{
this.width = width;
}

public double getWidth()
{
return this.width;
}

public void setHeight(double height)
{
this.height = height;
}
public double getHeight()
{
return this.height;
}
//计算周长的方法
private double getPerimeter()
{
return (width+height)*2;
}
//计算面积的方法
private double getArea()
{
return width*height;
}

public static void main(String[] args)
{
Rectangle rec = new Rectangle(3.6,5.8);
System.out.println("The perimeter of Rectangle is:"+rec.getPerimeter());
System.out.println("The area of Rectangle is:"+rec.getArea());
}
}