SDUT Java 类和对象

6-7 sdut-oop-6-方形矩阵的运算（类和对象）

class Matrix{ int n; int[][] matrix; //带参构造方法 public Matrix(int n, int[][] matrix) { this.n = n; this.matrix = matrix; } public Matrix add(Matrix other) { int [][ ]result=new int [n][n]; for(int i=0;i<matrix.length;i++) { for(int j=0;j<matrix[i].length;j++) { result[i][j]=matrix[i][j]+other.matrix[i][j]; } } return new Matrix(n,result); } public Matrix sub(Matrix other) { int [][ ]result=new int [n][n]; for(int i=0;i<matrix.length;i++) for(int j=0;j<matrix[i].length;j++) { result[i][j]=matrix[i][j]-other.matrix[i][j]; } return new Matrix(n,result); } public Matrix mul(Matrix other){ int [][ ]result=new int [n][n]; for(int i=0;i<matrix.length;i++) { for(int j=0;j<matrix[i].length;j++) { int sum=0; for(int k=0;k<matrix[i].length;k++) { result[i][j]+=matrix[i][k]*other.matrix[k][j]; } } } return new Matrix(n,result); } public void show(){ for(int i=0;i<matrix.length;i++) { for(int j=0;j<matrix[i].length;j++) { System.out.print(matrix[i][j]+" "); } System.out.println(); } } }

6-9 sdut-oop-5 分数加减法（类和对象)

class Fs { int fz, fm; public Fs(int fz, int fm) { this.fz = fz; this.fm = fm; } public Fs add(Fs fs) { int sum1=this.fz*fs.fm+this.fm*fs.fz; int sum2=this.fm*fs.fm; if(sum1%sum2==0) return new Fs(sum1,sum2); else { int gcdd=gcd(sum1,sum2); return new Fs(sum1/gcdd,sum2/gcdd); } } public Fs sub(Fs fs) { int sum1=this.fz*fs.fm-this.fm*fs.fz; int sum2=this.fm*fs.fm; if(sum1%sum2==0) return new Fs(sum1,sum2); else { int gcdd=gcd(sum1,sum2); return new Fs(sum1/gcdd,sum2/gcdd); } } public int gcd(int a, int b) { a=Math.abs(a); b=Math.abs(b); int c=a%b; while(c!=0) { a=b; b=c; c=a%b; } return b; } }

7-1 sdut-oop-1 简单的复数运算

package 复习; import java.util.Scanner; public class Main{ public static void main(String[] args) { Scanner sc = new Scanner(System.in); int n = sc.nextInt(); int m = sc.nextInt(); while(sc.hasNext()) { int a = sc.nextInt(); int b = sc.nextInt(); int op=sc.nextInt(); if(a==0&&b==0&&op==0) break; else{ if(op==1) { n+=a; m+=b; } else if(op==2) { n-=a; m-=b; } else if(op==3) { int nn=n; int mm=m; n=nn*a-mm*b; m=nn*b+mm*a; } } } System.out.println(n+" "+m); } }

7-4 sdut-oop-4-求圆的面积（类与对象）

import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); Circle c1 = new Circle(); System.out.println(c1.toString()); System.out.printf("%.2f\n", c1.getArea()); Circle c2 = new Circle(); System.out.println(c2.toString()); System.out.printf("%.2f\n", c2.getArea()); double radius = sc.nextDouble(); c2.setRadius(radius);//！！！！！！！！ System.out.println(c2.toString()); System.out.printf("%.2f\n", c2.getArea()); Circle c3 = new Circle(sc.nextDouble()); System.out.println(c3.toString()); System.out.printf("%.2f\n", c3.getArea()); } } class Circle { private double radius; public Circle() { this.radius = 2.0; System.out.println("This is a constructor with no para."); } public Circle(double radius) { if (radius <= 0) { this.radius = 2.0; } else { this.radius = radius; } System.out.println("This is a constructor with para."); } public double getRadius() { return radius; } public void setRadius(double radius) { if (radius <= 0) { this.radius = 2.0; } else { this.radius = radius; } } public double getArea() { return Math.PI * radius * radius; } public String toString() { return "Circle [" + "radius=" + (int)radius + "]"; } }

7-5 sdut-oop-9 计算长方形的周长和面积（类和对象）

import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); while (sc.hasNext()) { String ss = sc.nextLine(); String arr[]=ss.split(" "); if(arr.length==1) { int w=Integer.parseInt(arr[0]); int h=w; int l=w*4; int s=w*w; if(w<=0) System.out.println("0 0 0 0"); else System.out.println(h+" "+w+" "+l+" "+s); } else if(arr.length==2) { int h=Integer.parseInt(arr[0]); int w=Integer.parseInt(arr[1]); int l=(w+h)*2; int s=w*h; if(h<=0||w<=0) System.out.println("0 0 0 0"); else System.out.println(h+" "+w+" "+l+" "+s); } } } }

7-6 sdut-谁是最强的女汉子

import java.util.*; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int n = sc.nextInt(); int min=0; int a[]=new int[10000]; int b[]=new int[10000]; for(int i=0;i<n;i++) { int x = sc.nextInt(); int y = sc.nextInt(); if(i==0) min=x; else min=Math.min(min,x); a[x]+=y; b[x]++; } System.out.println(b[min]+" "+a[min]); } }

7-7 sdut-oop-8 分数四则运算

package 复习; import java.util.*; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int n = sc.nextInt(); for(int i=0;i<n;i++) { String s = sc.next(); String ss[]=s.split("[/+\\-*\\\\]"); int a=Integer.parseInt(ss[0]); int b=Integer.parseInt(ss[1]); int c=Integer.parseInt(ss[2]); int d=Integer.parseInt(ss[3]); char s2=s.charAt(ss[0].length()+ss[1].length()+1); if(s2=='*') { int sum1=a*c; int sum2=b*d; if(sum1%sum2==0) System.out.println(sum1/sum2); else{ int gcdd=gcd(sum1,sum2); System.out.println(sum1/gcdd+"/"+sum2/gcdd); } } else if(s2=='\\'){ int sum1=a*d; int sum2=b*c; if(sum1%sum2==0) { System.out.println(sum1/sum2); } else{ int gcdd=gcd(sum1,sum2); System.out.println(sum1/gcdd+"/"+sum2/gcdd); } } else if(s2=='+') { int sum1=a*d+b*c; int sum2=b*d; if(sum1%sum2==0) System.out.println(sum1/sum2); else{ int gcdd=gcd(sum1,sum2); System.out.println(sum1/gcdd+"/"+sum2/gcdd); } } else if(s2=='-') { int sum1=a*d-b*c; int sum2=b*d; if(sum1%sum2==0) System.out.println(sum1/sum2); else{ int gcdd=gcd(sum1,sum2); System.out.println(sum1/gcdd+"/"+sum2/gcdd); } } } } public static int gcd(int a,int b) { a=Math.abs(a); b=Math.abs(b); int c=a%b; while(c!=0) { a=b; b=c; c=a%b; } return b; } }