7-1 数组重排
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int a=in.nextInt();
int [] b=new int [a];
for(int i=0;i<b.length;i++){
b[i]=in.nextInt();
}
if (b == null || b.length < 2) {
for(int i=0;i<b.length;i++){
System.out.print(b[i]+" ");
}
}
int start = 0;
int end = b.length - 1;
while (start < end) {
while (start < end && b[start] % 2 != 0) {
start++;
}
while (start < end && b[end] % 2 == 0) {
end--;
}
int temp = b[start];
b[start] = b[end];
b[end] = temp;
}
for(int i=0;i<b.length;i++){
System.out.print(b[i]+" ");
}}
}
7-2 sdut-oop-6 计算各种图形的周长(多态)
import java.util.*;
public class Main
{
public static void main(String[] args)
{
Scanner cin = new Scanner(System.in);
double a,b,c;
Shape x;
String str;
String []s;
while(cin.hasNextLine())//cin.nextLine()吸收空格和tab,遇到回车停止。
{
str = cin.nextLine();
s = str.split(" ");
if(s.length==1)//判断输入的数字有几个,若只要一个即为圆形,两个即为长方形,三个即为三角形
{
a = Double.parseDouble(s[0]);
x = new Circle(a);
System.out.printf("%.2f\n",x.length());
}
else if(s.length==2)
{
a = Double.parseDouble(s[0]);
b = Double.parseDouble(s[1]);
x = new Rectangle(a,b);
System.out.printf("%.2f\n",x.length());
}
else if(s.length==3)
{
a = Double.parseDouble(s[0]);
b = Double.parseDouble(s[1]);
c = Double.parseDouble(s[2]);
x = new Triangle(a,b,c);
System.out.printf("%.2f\n",x.length());
}
}
cin.close();
}
}
interface Shape//接口,实现输入各图形的周长
{
public double length();
}
class Triangle implements Shape//三角形类
{
double a,b,c;
Triangle(double a,double b,double c)//构造方法
{
this.a = a;
this.b = b;
this.c = c;
}
public double length()//重写实现周长的方法
{
if(a<=0||b<=0||c<=0)//输入是否非法
return 0;
if(a+b<=c||a+c<=b||b+c<=a)//是否能构成三角形
return 0;
return a + b + c;
}
}
class Rectangle implements Shape//长方形类
{
double a,b;
Rectangle(double a,double b)//构造方法
{
this.a = a;
this.b = b;
}
public double length()//重写实现周长方法
{
if(a<=0||b<=0)//输入是否非法
return 0;
return (a + b) * 2;
}
}
class Circle implements Shape//圆形类
{
double a;
Circle(double a)//构造方法
{
this.a = a;
}
public double length()//重写实现周长方法
{
if(a<=0)//输入是否非法
return 0;
return a * 3.14 * 2;
}
}
7-3 接口--四则计算器
import java.util.Scanner;
public class Main{
public static void main(String[] args) {
Scanner in=new Scanner(System.in);
int n=in.nextInt();
int m=in.nextInt();
Add l=new Add();
Sub j=new Sub();
System.out.println(l.computer(n, m));
System.out.println(j.computer(n, m));
in.close();
}
}
interface IComputer{
abstract public int computer(int n ,int m);
}
class Add implements IComputer
{
int m,n;
public int computer(int n ,int m) {
return n+m;
}
}
class Sub implements IComputer
{
int m,n;
public int computer(int n ,int m) {
return n-m;
}
}
7-4 教师类
import java.util.Scanner;
class Teacher{
int no;
String name;
String seminary;
int age;
public Teacher(){
}
public Teacher(int no, String name,int age, String seminary) {
this.no = no;
this.name = name;
this.seminary = seminary;
this.age = age;
}
public int getNo() {
return no;
}
public void setNo(int no) {
this.no = no;
}
public String getName() {
return name;
}
public void setName(String name) {
this.name = name;
}
public String getSeminary() {
return seminary;
}
public void setSeminary(String seminary) {
this.seminary = seminary;
}
public int getAge() {
return age;
}
public void setAge(int age) {
this.age = age;
}
public boolean equals(Object obj){
Teacher t=(Teacher) obj;
if(this.no==t.no)
return true;
return false;
}
public String toString(){
return "no: "+this.no+", name:"+this.name+", age: "+this.age+", seminary: "+seminary;
}
}
public class Main {
public static void main(String[] args) {
Scanner s=new Scanner(System.in);
Teacher t=new Teacher(s.nextInt(),s.next(),s.nextInt(),s.next());
Teacher t1=new Teacher(s.nextInt(),s.next(),s.nextInt(),s.next());
System.out.println(t.toString());
System.out.println(t1.toString());
System.out.println(t.equals(t1));
}
}
7-5 统计最大数出现次数
import java.util.Scanner;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int a;
int max=-1;
int count=1;
do {
a=sc.nextInt();
if (max<a) {
max = a;
count=1;
}
else if (max==a)count++;
}while (a!=0);
System.out.println("The largest number is "+max);
System.out.println("The occurrence count of the largest number is "+count);
}
}