Java语言程序设计与数据结构（基础篇）课后练习题 第十三章（三）

最新推荐文章于 2022-06-18 18:57:34 发布
最新推荐文章于 2022-06-18 18:57:34 发布
阅读量4.1k 收藏 50
点赞数 17
分类专栏： 计算机黑皮书 文章标签： java 数据结构
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/IT_Holmes/article/details/112027091
版权
该博客展示了如何使用Java实现复数和有理数的加减乘除运算，包括大整数的欧几里得算法求最大公约数。还提供了将十进制数转换为有理数的示例，并演示了如何计算一元二次方程的根。此外，还包含了计算复数绝对值的功能。
摘要由CSDN通过智能技术生成

13.15

package dishisanzhang;

import java.math.BigInteger;

public class Rational extends Number implements Comparable< Rational > {

private BigInteger numerator = new BigInteger("0");
private BigInteger denominator = new BigInteger("1");

public Rational() {
	this(new BigInteger("0"), new BigInteger("1"));
}

public Rational(BigInteger numerator, BigInteger denominator) {
	BigInteger gcd = gcd(numerator, denominator);
	if (denominator.compareTo(new BigInteger("0")) > 0) {
		this.numerator = numerator.divide(gcd);
	} else
		this.numerator = numerator.multiply(new BigInteger("-1")).divide(gcd);
	this.denominator = denominator.abs().divide(gcd);
}

private static BigInteger gcd(BigInteger n, BigInteger d) {
	BigInteger n1 = n.abs();
	BigInteger n2 = d.abs();
	BigInteger gcd = new BigInteger("1");

	BigInteger n3 = new BigInteger("1");
	for (int i = 1; i <= n1.intValue() && i <= n2.intValue(); i++) {
		if ((n1.remainder(n3).equals(new BigInteger("0"))) && (n2.remainder(n3).equals(new BigInteger("0")))) {
			gcd = n3;
		}
		n3 = n3.add(new BigInteger("1"));
	}

	return gcd;
}

public BigInteger getNumerator() {
	return numerator;
}

public BigInteger getDenominator() {
	return denominator;
}

public Rational add(Rational secondRational) {
	BigInteger n = numerator.multiply(secondRational.getDenominator())
			.add(denominator.multiply(secondRational.getNumerator()));
	BigInteger d = denominator.multiply(secondRational.getDenominator());
	return new Rational(n, d);
}

public Rational subtract(Rational secondRational) {
	BigInteger n = numerator.multiply(secondRational.getDenominator())
			.subtract(denominator.multiply(secondRational.getNumerator()));
	BigInteger d = denominator.multiply(secondRational.getDenominator());
	return new Rational(n, d);
}

public Rational multiply(Rational secondRational) {
	BigInteger n = numerator.multiply(secondRational.getNumerator());
	BigInteger d = denominator.multiply(secondRational.getDenominator());
	return new Rational(n, d);
}

public Rational divide(Rational secondRational) {
	BigInteger n = numerator.multiply(secondRational.getDenominator());
	BigInteger d = denominator.multiply(secondRational.getNumerator());
	return new Rational(n, d);
}

@Override
public String toString() {
	if (denominator.equals(new BigInteger("1")) || numerator.equals(new BigInteger("0"))) {
		return numerator.toString();
	} else
		return numerator.toString() + "/" + denominator.toString();
}

@Override
public boolean equals(Object other) {
	if (this.subtract((Rational) other).getNumerator().equals(new BigInteger("0"))) {
		return true;
	} else
		return false;
}

@Override
public int intValue() {
	return (int) doubleValue();
}

@Override
public float floatValue() {
	return (float) doubleValue();
}

@Override
public double doubleValue() {
	return numerator.divide(denominator).doubleValue();
}

@Override
public long longValue() {
	return (long) doubleValue();
}

@Override
public int compareTo(Rational o) {
	if (this.subtract(o).getNumerator().compareTo(new BigInteger("0")) > 0)
		return 1;
	else if (this.subtract(o).getNumerator().compareTo(new BigInteger("0")) < 0)
		return -1;
	else
		return 0;
}

}

package dishisanzhang;

import java.math.BigInteger;
import java.util.Scanner;

public class dishisanzhang {

public static void main(String[] args) throws CloneNotSupportedException {
	Scanner input = new Scanner(System.in);
	System.out.print("Enter the first rational number: ");
	BigInteger n1 = new BigInteger(input.nextInt()+"");
	BigInteger n2 = new BigInteger(input.nextInt()+"");
	Rational r1 = new Rational(n1,n2);
	System.out.print("Enter the second second number: ");
	BigInteger n3 = new BigInteger(input.nextInt()+"");
	BigInteger n4 = new BigInteger(input.nextInt()+"");
	Rational r2 = new Rational(n3,n4);
	System.out.println(n1+"/"+n2+" + "+n3+"/"+n4+" = "+r1.add(r2));
	System.out.println(n1+"/"+n2+" - "+n3+"/"+n4+" = "+r1.subtract(r2));
	System.out.println(n1+"/"+n2+" * "+n3+"/"+n4+" = "+r1.multiply(r2));
	System.out.println(n1+"/"+n2+" / "+n3+"/"+n4+" = "+r1.divide(r2));
	System.out.println(n3+"/"+n4+" is "+(n3.floatValue()/n4.floatValue()));
	//		3 454
	//		7 2389
}

}

13.16

package dishisanzhang;

import java.math.BigInteger;

public class dishisanzhang {

public static void main(String[] args) throws CloneNotSupportedException {
	String[] s = args[0].split("[/ ]");

	if (s.length == 5) {
		calculator(s);
	} else if (s.length == 6) {
		String[] s2 = { s[0], s[1], "/", s[4], s[5] };
		calculator(s2);
	}
}

public static void calculator(String[] s) {
	BigInteger n1 = new BigInteger(s[0]);
	BigInteger d1 = new BigInteger(s[1]);
	Rational r1 = new Rational(n1, d1);

	BigInteger n2 = new BigInteger(s[3]);
	BigInteger d2 = new BigInteger(s[4]);
	Rational r2 = new Rational(n2, d2);

	System.out.print(Integer.parseInt(s[0]) + "/" + Integer.parseInt(s[1]) + " " + Integer.parseInt(s[2]) + " "
			+ Integer.parseInt(s[3]) + "/" + Integer.parseInt(s[4]) + " = ");

	switch (s[2].charAt(0)) {
	case '+':
		System.out.println(Integer.parseInt(r1.add(r2).toString()));
		break;
	case '-':
		System.out.println(Integer.parseInt(r1.subtract(r2).toString()));
		break;
	case '*':
		System.out.println(Integer.parseInt(r1.multiply(r2).toString()));
		break;
	case '/':
		System.out.println(Integer.parseInt(r1.divide(r2).toString()));
	}
}

}

13.17

package dishisanzhang;

public class Complex implements Cloneable, Comparable< Complex > {

private double realPart;
private double imaginaryPart;

public Complex() {
}

public Complex(double a) {
	this(a, 0);
}

public Complex(double a, double b) {
	this.realPart = a;
	this.imaginaryPart = b;
}

public double getRealPart() {
	return realPart;
}

public double getImaginaryPart() {
	return imaginaryPart;
}

public Complex add(Complex c) {
	double r = realPart + c.getRealPart();
	double i = imaginaryPart + c.getImaginaryPart();
	return new Complex(r, i);
}

public Complex subtract(Complex c) {
	double r = realPart - c.getRealPart();
	double i = imaginaryPart - c.getImaginaryPart();
	return new Complex(r, i);
}

public Complex multiply(Complex c) {
	double r = realPart * c.getRealPart() - imaginaryPart * c.getImaginaryPart();
	double i = realPart * c.getImaginaryPart() + imaginaryPart * c.getRealPart();

	return new Complex(r, i);
}

public Complex divide(Complex c) {
	double r = (realPart * c.getRealPart() + imaginaryPart * c.getImaginaryPart())
			/ (c.getRealPart() * c.getRealPart() + c.getImaginaryPart() * c.getImaginaryPart());
	double i = (realPart * c.getImaginaryPart() - imaginaryPart * c.getRealPart())
			/ (c.getRealPart() * c.getRealPart() + c.getImaginaryPart() * c.getImaginaryPart());

	return new Complex(r, i);
}

public double abs() {
	return Math.sqrt(realPart * realPart + imaginaryPart * imaginaryPart);
}

@Override
public String toString() {
	if (realPart == 0)
		return imaginaryPart + "i";
	else if (imaginaryPart == 0)
		return realPart + "";
	else
		return realPart + " + " + imaginaryPart + "i";
}

@Override
public Object clone() {
	return new Complex(realPart, imaginaryPart);
}

@Override
public int compareTo(Complex c) {
	if (this.abs() > c.abs())
		return 1;
	else if (this.abs() < c.abs())
		return -1;
	else
		return 0;
}

}

package dishisanzhang;

import java.util.Scanner;

public class dishisanzhang {

public static void main(String[] args) throws CloneNotSupportedException {
	Scanner input = new Scanner(System.in);
    System.out.print("Enter the first complex number : ");
    double r1 = input.nextDouble();
    double i1 = input.nextDouble();
    Complex complex1 = new Complex(r1, i1);

    System.out.print("Enter the second complex number : ");
    double r2 = input.nextDouble();
    double i2 = input.nextDouble();
    Complex complex2 = new Complex(r2, i2);

    String c1 = "(" + r1 + " + " + i1 + "i)";
    String c2 = "(" + r2 + " + " + i2 + "i)";
    System.out.println( c1 + " + " + c2 + " = " + complex1.add(complex2));
    System.out.println( c1 + " - " + c2 + " = " + complex1.subtract(complex2));
    System.out.println( c1 + " * " + c2 + " = " + complex1.multiply(complex2));
    System.out.println( c1 + " / " + c2 + " = " + complex1.divide(complex2));
    System.out.println( "|" + c1 + " + " + c2 + "| = " + complex1.abs());
    //        3.5 5.5
	//        -3.5 1
}

}

13.18

package dishisanzhang;

import java.math.BigInteger;

public class Rational implements Comparable< Rational > {

private BigInteger numerator = new BigInteger("0");
private BigInteger denominator = new BigInteger("1");

public Rational() {
	this(new BigInteger("0"), new BigInteger("1"));
}

public Rational(BigInteger numerator, BigInteger denominator) {
	BigInteger gcd = gcd(numerator, denominator);
	if (denominator.compareTo(new BigInteger("0")) > 0) {
		this.numerator = numerator.divide(gcd);
	} else
		this.numerator = numerator.multiply(new BigInteger("-1")).divide(gcd);
	this.denominator = denominator.abs().divide(gcd);
}

private static BigInteger gcd(BigInteger n, BigInteger d) {
	BigInteger n1 = n.abs();
	BigInteger n2 = d.abs();
	BigInteger gcd = new BigInteger("1");

	BigInteger n3 = new BigInteger("1");
	for (int i = 1; i <= n1.intValue() && i <= n2.intValue(); i++) {
		if ((n1.remainder(n3).equals(new BigInteger("0"))) && (n2.remainder(n3).equals(new BigInteger("0")))) {
			gcd = n3;
		}
		n3 = n3.add(new BigInteger("1"));
	}

	return gcd;
}

public BigInteger getNumerator() {
	return numerator;
}

public BigInteger getDenominator() {
	return denominator;
}

public Rational add(Rational secondRational) {
	BigInteger n = numerator.multiply(secondRational.getDenominator())
			.add(denominator.multiply(secondRational.getNumerator()));
	BigInteger d = denominator.multiply(secondRational.getDenominator());
	return new Rational(n, d);
}

public Rational subtract(Rational secondRational) {
	BigInteger n = numerator.multiply(secondRational.getDenominator())
			.subtract(denominator.multiply(secondRational.getNumerator()));
	BigInteger d = denominator.multiply(secondRational.getDenominator());
	return new Rational(n, d);
}

public Rational multiply(Rational secondRational) {
	BigInteger n = numerator.multiply(secondRational.getNumerator());
	BigInteger d = denominator.multiply(secondRational.getDenominator());
	return new Rational(n, d);
}

public Rational divide(Rational secondRational) {
	BigInteger n = numerator.multiply(secondRational.getDenominator());
	BigInteger d = denominator.multiply(secondRational.getNumerator());
	return new Rational(n, d);
}

@Override
public String toString() {
	if (denominator.equals(new BigInteger("1")) || numerator.equals(new BigInteger("0"))) {
		return numerator.toString();
	} else
		return numerator.toString() + "/" + denominator.toString();
}

@Override
public boolean equals(Object other) {
	if (this.subtract((Rational) other).getNumerator().equals(new BigInteger("0"))) {
		return true;
	} else
		return false;
}

public int intValue() {
	return (int) doubleValue();
}

public float floatValue() {
	return (float) doubleValue();
}

public double doubleValue() {
	return numerator.divide(denominator).doubleValue();
}

public long longValue() {
	return (long) doubleValue();
}

@Override
public int compareTo(Rational o) {
	if (this.subtract(o).getNumerator().compareTo(new BigInteger("0")) > 0)
		return 1;
	else if (this.subtract(o).getNumerator().compareTo(new BigInteger("0")) < 0)
		return -1;
	else
		return 0;
}

}

package dishisanzhang;

import java.math.BigInteger;

public class dishisanzhang {

public static void main(String[] args) throws CloneNotSupportedException {
	Rational sum = new Rational();
	Rational s = null;
	for (int i = 1; i < 100; i++) {
		s = new Rational(new BigInteger(new Integer(i)+""),
				new BigInteger(new Integer(i + 1)+""));
		sum = sum.add(s);
		System.out.println(100 - i);
	}
	//慢慢等吧，等到输出0，你就看到结果了哈哈！！！
	System.out.println(sum);
}

}

13.19

方向好像写错了，结果对！，想改改的自己改改就行。

package dishisanzhang;

import java.math.BigInteger;

public class Rational extends Number implements Comparable< Rational > {

private BigInteger numerator = new BigInteger("0");
private BigInteger denominator = new BigInteger("1");

public Rational() {
	this(new BigInteger("0"), new BigInteger("1"));
}

public Rational(BigInteger numerator, BigInteger denominator) {
	BigInteger gcd = gcd(numerator, denominator);
	if (denominator.compareTo(new BigInteger("0")) > 0) {
		this.numerator = numerator.divide(gcd);
	} else
		this.numerator = numerator.multiply(new BigInteger("-1")).divide(gcd);
	this.denominator = denominator.abs().divide(gcd);
}

private static BigInteger gcd(BigInteger n, BigInteger d) {
	BigInteger n1 = n.abs();
	BigInteger n2 = d.abs();
	BigInteger gcd = new BigInteger("1");

	BigInteger n3 = new BigInteger("1");
	for (int i = 1; i <= n1.intValue() && i <= n2.intValue(); i++) {
		if ((n1.remainder(n3).equals(new BigInteger("0"))) && (n2.remainder(n3).equals(new BigInteger("0")))) {
			gcd = n3;
		}
		n3 = n3.add(new BigInteger("1"));
	}

	return gcd;
}

public BigInteger getNumerator() {
	return numerator;
}

public BigInteger getDenominator() {
	return denominator;
}

public Rational add(Rational secondRational) {
	BigInteger n = numerator.multiply(secondRational.getDenominator())
			.add(denominator.multiply(secondRational.getNumerator()));
	BigInteger d = denominator.multiply(secondRational.getDenominator());
	return new Rational(n, d);
}

public Rational subtract(Rational secondRational) {
	BigInteger n = numerator.multiply(secondRational.getDenominator())
			.subtract(denominator.multiply(secondRational.getNumerator()));
	BigInteger d = denominator.multiply(secondRational.getDenominator());
	return new Rational(n, d);
}

public Rational multiply(Rational secondRational) {
	BigInteger n = numerator.multiply(secondRational.getNumerator());
	BigInteger d = denominator.multiply(secondRational.getDenominator());
	return new Rational(n, d);
}

public Rational divide(Rational secondRational) {
	BigInteger n = numerator.multiply(secondRational.getDenominator());
	BigInteger d = denominator.multiply(secondRational.getNumerator());
	return new Rational(n, d);
}

@Override
public String toString() {
	if (denominator.equals(new BigInteger("1")) || numerator.equals(new BigInteger("0"))) {
		return numerator.toString();
	} else
		return numerator.toString() + "/" + denominator.toString();
}

@Override
public boolean equals(Object other) {
	if (this.subtract((Rational) other).getNumerator().equals(new BigInteger("0"))) {
		return true;
	} else
		return false;
}

@Override
public int intValue() {
	return (int) doubleValue();
}

@Override
public float floatValue() {
	return (float) doubleValue();
}

@Override
public double doubleValue() {
	return numerator.divide(denominator).doubleValue();
}

@Override
public long longValue() {
	return (long) doubleValue();
}

@Override
public int compareTo(Rational o) {
	if (this.subtract(o).getNumerator().compareTo(new BigInteger("0")) > 0)
		return 1;
	else if (this.subtract(o).getNumerator().compareTo(new BigInteger("0")) < 0)
		return -1;
	else
		return 0;
}

}

package dishisanzhang;

import java.math.BigInteger;
import java.util.Scanner;

public class dishisanzhang {

public static void main(String[] args) {
	// TODO Auto-generated method stub
	Scanner input = new Scanner(System.in);
	System.out.print("Enter a decimal number: ");
	String str = input.next();
	boolean bl = true;
	if (str.charAt(0) == '-')
		bl = false;
	String[] s = new String[2];
	s = str.split("\\.");
	int a = Integer.parseInt(s[0]);
	int b = Integer.parseInt(s[1]);
	int length = s[1].length();
	int numerator1 = (int) (a * Math.pow(10, length) + b);
	int denominator1 = (int) Math.pow(10, length);
	int greatestCommonDivisor = maxCommonDivisor(numerator1, denominator1);
	int numrator2 = numerator1 / greatestCommonDivisor;
	int denominator2 = denominator1 / greatestCommonDivisor;
	Rational r1 = new Rational(new BigInteger(numrator2 + ""), new BigInteger(denominator2 + ""));

	if (bl)
		System.out.println("The fraction number is " + r1);
	else
		System.out.println("The fraction number is -" + r1);
}

public static int maxCommonDivisor(int m, int n) {
	if (m < n) {
		int temp = m;
		m = n;
		n = temp;
	}
	while (m % n != 0) {
		int temp = m % n;
		m = n;
		n = temp;
	}
	return n;

}

}

13.20

package dishisanzhang;

public class Complex implements Cloneable, Comparable< Complex > {

private double realPart;
private double imaginaryPart;

public Complex() {
}

public Complex(double a) {
	this(a, 0);
}

public Complex(double a, double b) {
	this.realPart = a;
	this.imaginaryPart = b;
}

public double getRealPart() {
	return realPart;
}

public double getImaginaryPart() {
	return imaginaryPart;
}

public Complex add(Complex c) {
	double r = realPart + c.getRealPart();
	double i = imaginaryPart + c.getImaginaryPart();
	return new Complex(r, i);
}

public Complex subtract(Complex c) {
	double r = realPart - c.getRealPart();
	double i = imaginaryPart - c.getImaginaryPart();
	return new Complex(r, i);
}

public Complex multiply(Complex c) {
	double r = realPart * c.getRealPart() - imaginaryPart * c.getImaginaryPart();
	double i = realPart * c.getImaginaryPart() + imaginaryPart * c.getRealPart();

	return new Complex(r, i);
}

public Complex divide(Complex c) {
	double r = (realPart * c.getRealPart() + imaginaryPart * c.getImaginaryPart())
			/ (c.getRealPart() * c.getRealPart() + c.getImaginaryPart() * c.getImaginaryPart());
	double i = (realPart * c.getImaginaryPart() - imaginaryPart * c.getRealPart())
			/ (c.getRealPart() * c.getRealPart() + c.getImaginaryPart() * c.getImaginaryPart());

	return new Complex(r, i);
}

public double abs() {
	return Math.sqrt(realPart * realPart + imaginaryPart * imaginaryPart);
}

@Override
public String toString() {
	if (realPart == 0)
		return imaginaryPart + "i";
	else if (imaginaryPart == 0)
		return realPart + "";
	else
		return realPart + " + " + imaginaryPart + "i";
}

@Override
public Object clone() {
	return new Complex(realPart, imaginaryPart);
}

@Override
public int compareTo(Complex c) {
	if (this.abs() > c.abs())
		return 1;
	else if (this.abs() < c.abs())
		return -1;
	else
		return 0;
}

}

package dishisanzhang;

import java.util.Scanner;

public class dishisanzhang {

public static void main(String[] args) {
	// TODO Auto-generated method stub
	Scanner input = new Scanner(System.in);
	System.out.print("Enter a, b, c:");
	double a = input.nextDouble();
	double b = input.nextDouble();
	double c = input.nextDouble();
	double delta = b * b - 4 * a * c;
	if (delta < 0) {
		double real1 = -1 * b / 2 / a;
		double imaginary1 = Math.pow(-delta, 0.5) / 2 / a;
		Complex complex1 = new Complex(real1, imaginary1);
		double real2 = -1 * b / 2 / a;
		double imaginary2 = -Math.pow(-delta, 0.5) / 2 / a;
		Complex complex2 = new Complex(real2, imaginary2);
		System.out.println("The roots are " + complex1 + " and " + complex2);
	} else if (delta == 0)
		System.out.println("The root is " + (-1 * b / 2 / a));
	else {
		double r1 = (-1 * b + Math.pow(delta, 0.5)) / 2 / a;
		double r2 = (-1 * b - Math.pow(delta, 0.5)) / 2 / a;
		System.out.println("The  roots are " + r1 + " and " + r2);
	}
}

}

13.21

package dishisanzhang;

import java.math.BigInteger;

public class Rational extends Number implements Comparable< Rational >{

private BigInteger numerator = new BigInteger("0");
private BigInteger denominator = new BigInteger("1");

public Rational() {
	this(new BigInteger("0"), new BigInteger("1"));
}

public Rational(BigInteger numerator, BigInteger denominator) {
	BigInteger gcd = gcd(numerator, denominator);
	if (denominator.compareTo(new BigInteger("0")) > 0) {
		this.numerator = numerator.divide(gcd);
	} else
		this.numerator = numerator.multiply(new BigInteger("-1")).divide(gcd);
	this.denominator = denominator.abs().divide(gcd);
}

private static BigInteger gcd(BigInteger n, BigInteger d) {
	BigInteger n1 = n.abs();
	BigInteger n2 = d.abs();
	BigInteger gcd = new BigInteger("1");

	BigInteger n3 = new BigInteger("1");
	for (int i = 1; i <= n1.intValue() && i <= n2.intValue(); i++) {
		if ((n1.remainder(n3).equals(new BigInteger("0"))) && (n2.remainder(n3).equals(new BigInteger("0")))) {
			gcd = n3;
		}
		n3 = n3.add(new BigInteger("1"));
	}

	return gcd;
}

public BigInteger getNumerator() {
	return numerator;
}

public BigInteger getDenominator() {
	return denominator;
}

public Rational add(Rational secondRational) {
	BigInteger n = numerator.multiply(secondRational.getDenominator())
			.add(denominator.multiply(secondRational.getNumerator()));
	BigInteger d = denominator.multiply(secondRational.getDenominator());
	return new Rational(n, d);
}

public Rational subtract(Rational secondRational) {
	BigInteger n = numerator.multiply(secondRational.getDenominator())
			.subtract(denominator.multiply(secondRational.getNumerator()));
	BigInteger d = denominator.multiply(secondRational.getDenominator());
	return new Rational(n, d);
}

public Rational multiply(Rational secondRational) {
	BigInteger n = numerator.multiply(secondRational.getNumerator());
	BigInteger d = denominator.multiply(secondRational.getDenominator());
	return new Rational(n, d);
}

public Rational divide(Rational secondRational) {
	BigInteger n = numerator.multiply(secondRational.getDenominator());
	BigInteger d = denominator.multiply(secondRational.getNumerator());
	return new Rational(n, d);
}

@Override
public String toString() {
	if (denominator.equals(new BigInteger("1")) || numerator.equals(new BigInteger("0"))) {
		return numerator.toString();
	} else
		return numerator.toString() + "/" + denominator.toString();
}

@Override
public boolean equals(Object other) {
	if (this.subtract((Rational) other).getNumerator().equals(new BigInteger("0"))) {
		return true;
	} else
		return false;
}

@Override
public int intValue() {
	return (int) doubleValue();
}

@Override
public float floatValue() {
	return (float) doubleValue();
}

@Override
public double doubleValue() {
	return numerator.divide(denominator).doubleValue();
}

@Override
public long longValue() {
	return (long) doubleValue();
}

@Override
public int compareTo(Rational o) {
	if (this.subtract(o).getNumerator().compareTo(new BigInteger("0")) > 0)
		return 1;
	else if (this.subtract(o).getNumerator().compareTo(new BigInteger("0")) < 0)
		return -1;
	else
		return 0;
}

}

package dishisanzhang;

import java.math.BigInteger;
import java.util.Scanner;

public class dishisanzhang {

public static void main(String[] args) {
	// TODO Auto-generated method stub
	Scanner input = new Scanner(System.in);
	System.out.print("Enter a,b,c: ");
	float a1 = input.nextInt();
	float b1 = input.nextInt();
	float c1 = input.nextInt();

	float h = (-1 * b1) / (2 * a1);
	float k = (4 * a1 * c1 - b1 * b1) / 4 / a1;

	String str = h + "";
	String str1 = k + "";
	System.out.print("h is " + getJieguo(str));
	System.out.print(" k is " + getJieguo(str1));
}

public static String getJieguo(String str) {
	boolean bl = true;
	if (str.charAt(0) == '-')
		bl = false;
	String[] s = new String[2];
	s = str.split("\\.");
	int a = Integer.parseInt(s[0]);
	int b = Integer.parseInt(s[1]);
	int length = s[1].length();
	int numerator1 = (int) (a * Math.pow(10, length) + b);
	int denominator1 = (int) Math.pow(10, length);
	int greatestCommonDivisor = maxCommonDivisor(numerator1, denominator1);
	int numrator2 = numerator1 / greatestCommonDivisor;
	int denominator2 = denominator1 / greatestCommonDivisor;
	Rational r1 = new Rational(new BigInteger(numrator2 + ""), new BigInteger(denominator2 + ""));
	if (bl)
		return "" + r1;
	else
		return "-" + r1;
}

public static int maxCommonDivisor(int m, int n) {
	if (m < n) {
		int temp = m;
		m = n;
		n = temp;
	}
	while (m % n != 0) {
		int temp = m % n;
		m = n;
		n = temp;
	}
	return n;

}

}

第十三章习题 完

xupengboo
关注
专栏目录
Java语言程序设计与数据结构（基础篇）课后练习题 第七章
m0_60147147的博客
03-29 836
对于很多Java工程师而言，想要提升技能，往往是自己摸索成长，不成体系的学习效果低效漫长且无助。整理的这些资料希望对Java开发的朋友们有所参考以及少走弯路，本文的重点是你有没有收获与成长，其余的都不重要，希望读者们能谨记这一点。再分享一波我的Java面试真题+视频学习详解+技能进阶书籍效果低效又漫长，而且极易碰到天花板技术停滞不前！**因此收集整理了一份《2024年Java开发全套学习资料》，初衷也很简单，就是希望能够帮助到想自学提升又不知道该从何学起的朋友，同时减轻大家的负担。
Java语言程序设计与数据结构（基础篇）课后练习题 第四章
最新发布
2401_83641098的博客
03-26 1002
学习技术是一条慢长而艰苦的道路，不能靠一时激情，也不是熬几天几夜就能学好的，必须养成平时努力学习的习惯。所以：贵在坚持！最后再分享的一些BATJ等大厂20、21年的面试题，把这些技术点整理成了视频和PDF（实际上比预期多花了不少精力），包含知识脉络 + 诸多细节，由于篇幅有限，上面只是以图片的形式给大家展示一部分。Mybatis面试专题MySQL面试专题并发编程面试专题里面都包含大厂面经、学习笔记、源码讲义、实战项目、讲解视频**如果你觉得这些内容对你有帮助，可以扫码领取！
Java语言程序设计与数据结构（基础篇）第13章课后习题代码chapter13.rar
07-04
Java语言程序设计与数据结构（基础篇）第13章课后习题代码
Java语言程序设计与数据结构（基础篇）课后练习题 第十三章（二）
探索技术与实践的旅程，分享编程经验与工具使用心得，助力开发者提升技能。
12-28 4098
13.8 package dishisanzhang; import java.util.ArrayList; public class MyStack implements Cloneable{ private ArrayList<Object> list = new ArrayList<>(); public boolean isEmpty(){ return list.isEmpty(); } public int getSize(){ return list.size
Java语言程序设计基础课后复习题答案第十三章
06-26
Java语言程序设计基础课后复习题答案第十三章。
《Java语言程序设计》（基础篇原书第10版）第十三章复习题答案
星晴的博客
07-10 6597
第十三章 13.1：e和f是合法的抽象类。 13.2：其好处是适用于通用编程，GeometricObject类型的变量在编译时使用getArea（）和getPerimeter（）方法。 13.3：输出结果为： True True False False True 13.4：在运行时，java虚拟机将尝试将numberRef转换为Double对象，但是numberRef是Integer的一个实例，而不是Double。 13.5：数组numberArray是Integer对象的数组，而非Double对象的数组
JAVA语言程序设计与数据结构第十版基础篇答案.rar
06-12
按章节整理过的java程序设计与数据结构的课后答案，同时也包含源代码文件，可直接运行！
Java语言程序设计基础第十版第十二章课后复习题答案
06-26
根据提供的信息，我们可以总结出以下关于《Java语言程序设计基础第十版》第十二章的一些关键知识点及解答： ### 一、异常处理基本概念 #### 12.1 **问题:** 异常处理的主要思想是什么？ **解答:** 异常处理的主要...
java语言程序设计-基础篇-课件(第13章)英文
06-23
java语言程序设计-基础篇--第八版--英文课件(第13章)
Java语言程序设计与数据结构（基础篇）第3章课后习题代码chapter3.rar
06-07
Java语言程序设计与数据结构（基础篇）第3章课后习题代码
Java程序设计与数据结构第三章习题答案
11-05
为学习Java程序设计的基础同学提供习题代码的参考，便于他们掌握多种方法，得到解决问题的思路与想法，Java程序设计与数据结构第三章习题答案！！！
Java语言程序设计与数据结构（基础篇）第5章课后习题代码chapter5.rar
06-07
Java语言程序设计与数据结构（基础篇）第5章课后习题代码
java黑皮书课后习题13.20 求解二元方程
weixin_42284882的博客
06-18 298
java黑皮书课后习题13.20 求解二元方程
面试合集：数据库+数据结构+JVM+网络+JAVA+分布式+操作系统
Qqun954715313的博客
02-05 1108
第一个模块：数据库 1.1 腾讯数据库面试问题 解释ACID四大特性 原子性的底层实现 数据库宕机后恢复的过程 如何保证事务的ACID特性 MySQL日志类型 这5个题目相对来说是比较普遍的，这里我就不一一给出答案了，给大家看下我的那个数据库学习笔记，这些题目在笔记里都是能找到的 1.2 我的数据库学习笔记 （1）自己整理的20个高频数据库学习知识点 事务四大特性（ACID）原子性、一致性、隔离性...
《Java语言程序设计与数据结构》编程练习答案（第五章）（一）
SWY's Workshop
02-23 1万+
《Java语言程序设计与数据结构》编程练习答案（第五章）（一） 英文名：Introduction to Java Programming and Data Structures, Comprehensive Version, 11th Edition 5.1 import java.util.Scanner; public class book { public static void m...
《Java语言程序设计与数据结构》编程练习答案（第七章）（一）
热门推荐
SWY's Workshop
02-28 1万+
《Java语言程序设计与数据结构》编程练习答案（第七章）（一） 英文名：Introduction to Java Programming and Data Structures, Comprehensive Version, 11th Edition 7.1 import java.util.Scanner; public class book { public static void m...
《Java语言程序设计与数据结构》编程练习答案（第二十二章）（一）
SWY's Workshop
06-27 1247
《Java语言程序设计与数据结构》编程练习答案（第二十二章）（一） 英文名：Introduction to Java Programming and Data Structures, Comprehensive Version, 11th Edition 22.1 public class book { public static void main(String[] args) { Scanner input = new Scanner(System.in);
《Java语言程序设计与数据结构》编程练习答案（第九章）
SWY's Workshop
02-29 1万+
《Java语言程序设计与数据结构》编程练习答案（第九章） 英文名：Introduction to Java Programming and Data Structure, Comprehensive Version, 11th Edition 9.1 public class book { public static void main(String[] args) { ...
java语言程序设计与数据结构基础篇
03-16
Java语言程序设计与数据结构基础篇是一门计算机科学的基础课程，主要涵盖了Java语言的基础知识和数据结构的基本概念。学习这门课程可以帮助学生掌握Java语言的基本语法、面向对象编程思想、常用数据结构和算法等知识，为以后的编程学习和实践打下坚实的基础。同时，这门课程也是计算机专业学生必修的一门课程，对于提高学生的编程能力和解决实际问题具有重要意义。
评论 3
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

xupengboo

你的鼓励将是我创作最大的动力。

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付：¥1
获取中
扫码支付

您的余额不足，请更换扫码支付或充值

打赏作者

实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值