C++对有理数进行表达并计算

C++对有理数进行表达并计算

#ifndef Rational_hpp
#define Rational_hpp

#include 
#include 
using namespace std;
class Radtional{
public:
    Radtional();
    Radtional(int numerator,int denominator);
    int getNumerator()const;
    int getDemominator()const;
    Radtional add(const Radtional& secondRational);
    Radtional sub(const Radtional& secondRational);
    Radtional mult(const Radtional& secondRational);
    Radtional div(const Radtional& secondRational);
    int compareTo(const Radtional& secondRational);
    bool equals(const Radtional& secondRational);
    int intValue();
    double doublevalue();
    string toString();
private:
    int numerator,denominator;
    static int gcd(int n,int d);

};
#endif 

#include "Rational.hpp"
#include 
#include 

Radtional::Radtional(){
    numerator = 0;
    denominator = 1;
}
Radtional::Radtional(int numerator,int denominator)
{
    int factor = gcd(numerator, denominator);
    this->numerator = ((numerator>0) ? 1: -1)*abs(numerator)/factor;
    this->denominator = abs(denominator)/factor;
}
int Radtional::getNumerator()const{
    return numerator;
}
int Radtional::getDemominator()const{
    return denominator;
}
int Radtional::gcd(int n, int d){
    int n1 = abs(n);
    int n2 = abs(d);
    int gcd =1;
    for (int i = 1; i<=n1&&i<=n2; i++) {
        if (n1%i==0&&n2%i==0) {
            gcd = i;
        }
    }
    return gcd;
}
Radtional Radtional::add(const Radtional& secondRational){
    int n = numerator*secondRational.getDemominator()+denominator*secondRational.getNumerator();
    int d = denominator * secondRational.getDemominator();
    return Radtional(n,d);
}
Radtional Radtional::sub(const Radtional &secondRational){
    int n = numerator * secondRational.getDemominator() - denominator* secondRational.getNumerator();
    int d = denominator * secondRational.getDemominator();
    return Radtional(n,d);
}
Radtional Radtional::mult(const Radtional &secondRational){
    int n = numerator * secondRational.getNumerator();
    int d = denominator * secondRational.getDemominator();
    return Radtional(n,d);
}
Radtional Radtional::div(const Radtional &secondRational){
    int n =numerator * secondRational.getDemominator();
    int d =denominator * secondRational.getNumerator();
    return Radtional(n,d);
}
int Radtional::compareTo(const Radtional &secondRational){
    Radtional temp =sub(secondRational);//两值相减
    if (temp.getNumerator()<0) {
        return -1;
    }
    else if (temp.getNumerator()==0){
        return 0;
    }
    else
        return 1;
}
bool Radtional::equals(const Radtional &secondRational){
    if (compareTo(secondRational)==0) {
        return true;
    }
    else
        return false;
}
int Radtional::intValue(){
    return getNumerator()/getDemominator();
}
double Radtional::doublevalue(){
    return 1.0*getNumerator()/getDemominator();
}
string Radtional::toString(){
    stringstream ss;
    ss<1) {
        ss<<"/"< 
简单测试
 
#include 
#include "Rational.hpp"
int main(int argc, const char * argv[]) {
    // insert code here...
    Radtional a(3,2);
    Radtional b(2,5);
    Radtional c(1,3);
    Radtional d(2,6);
    cout<
 
测试结果
 
 
 
欢迎分享，转载请注明来源：内存溢出
原文地址:https://54852.com/zaji/4950806.html