浅谈C++有理数的表达和计算

#ifndef Rational_hpp
#define Rational_hpp
#include <stdio.h>
#include <string>
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 /* Rational_hpp */
#include "Rational.hpp"
#include <sstream>
#include <cstdlib>
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<<numerator;
  if (denominator>1) {
      ss<<"/"<<denominator;
  }
  return ss.str();
}

简单测试

#include <iostream>
#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<<a.toString()<<" + "<<b.toString()<<"="<<(a.add(b)).toString()<<endl;
  cout<<a.toString()<<" - "<<b.toString()<<"="<<(a.sub(b)).toString()<<endl;
  cout<<a.toString()<<" * "<<b.toString()<<"="<<(a.mult(b)).toString()<<endl;
  cout<<a.toString()<<" / "<<b.toString()<<"="<<(a.div(b)).toString()<<endl;
  cout<<c.toString()<<" - "<<a.toString()<<"="<<(c.sub(a)).toString()<<endl;
  cout<<c.toString()<<"的int转换为"<<c.intValue()<<endl;
  cout<<c.toString()<<"的double转换为"<<c.doubleValue()<<endl;
  cout<<c.toString()<<"和"<<a.toString()<<"比较结果"<<c.compareTo(a)<<endl;
  cout<<c.toString()<<"和"<<d.toString()<<"比较结果"<<c.compareTo(d)<<endl;
  cout<<b.toString()<<"和"<<a.toString()<<"比较结果"<<b.compareTo(a)<<endl;
  return 0;
}

测试结果

 

总结

本篇文章就到这里了,希望能够给你带来帮助,也希望您能够多多关注编程宝库的更多内容!

 一、C强制转换C语言中的强制转换主要用于普通数据类型、指针的强制转换,没有类型检查,转换不安全,语法为:(type-id)expression//转换格式1type-id(expression)//转换 ...