3.28作业

1、上课写的复数类的实现,再写一遍,写出三种构造函数,算术运算符、关系运算符、逻辑运算符重载尝试实现自增、自减运算符的重载

#include <iostream>

using namespace std;
class Num
{
    int rel;   //实部
    int vir;   //虚部
public:
    Num():rel(2),vir(1)
    {
        cout << "Num的无参构造" << endl;
    }
    Num(int rel):rel(6)
    {
        cout << "Num有一个参数的构造" << endl;
    }
    Num(int rel,int vir):rel(rel),vir(vir)
    {
        cout << "Num有两个参数的构造" << endl;
    }
    void show()
    {
        cout << rel << "+" << vir << "i" << endl;
    }
    Num &operator=(const Num &other)
    {
        cout << "Num的拷贝赋值函数" << endl;
        this->rel = other.rel;
        this->vir = other.vir;
        return *this;
    }
    //算数运算符
    friend Num operator+(const Num n1,const Num n2);
    friend Num operator-(const Num n1,const Num n2);
    friend Num operator*(const Num n1,const Num n2);
    friend Num operator/(const Num n1,const Num n2);
    friend Num operator%(const Num n1,const Num n2);

    //关系运算符
    friend bool operator>(const Num n1,const Num n2);
    friend bool operator>=(const Num n1,const Num n2);
    friend bool operator<(const Num n1,const Num n2);
    bool operator<=(const Num n2);
    bool operator==(const Num n2);
    bool operator!=(const Num n2);
    
    //逻辑运算符
    friend bool operator&&(const Num n1,const Num n2);
    friend bool operator||(const Num n1,const Num n2);
    friend bool operator!(const Num n2);
};

Num operator+(const Num n1,const Num n2)
{
    Num temp;
    temp.rel = n1.rel+n2.rel;
    temp.vir = n1.vir+n2.vir;
    return temp;
}

Num operator-(const Num n1,const Num n2)
{
    Num temp;
    temp.rel = n1.rel-n2.rel;
    temp.vir = n1.vir-n2.vir;
    return temp;
}

Num operator*(const Num n1,const Num n2)
{
    Num temp;
    temp.rel = n1.rel*n2.rel;
    temp.vir = n1.vir*n2.vir;
    return temp;
}

Num operator/(const Num n1,const Num n2)
{
    Num temp;
    temp.rel = n1.rel/n2.rel;
    temp.vir = n1.vir/n2.vir;
    return temp;
}

Num operator%(const Num n1,const Num n2)
{
    Num temp;
    temp.rel = n1.rel%n2.rel;
    temp.vir = n1.vir%n2.vir;
    return temp;
}

bool operator>(const Num n1,const Num n2)
{
    if(n1.rel > n2.rel)  //如果n1的实部>n2的实部
    {
        return n1.rel>n2.rel;
    }
    else if(n1.rel == n2.rel)  //如果n1和n2的实部相同,返回虚部比较的结果
    {
        return n1.vir > n2.vir;
    }
    return n1.rel>n2.rel;
}

bool operator>=(const Num n1,const Num n2)
{
    if(n1.rel > n2.rel)
    {
        return n1.rel>n2.rel;
    }
    else if(n1.rel == n2.rel)
    {
        return n1.vir>=n2.vir;
    }
    return n1.rel>n2.rel;
}

bool operator<(const Num n1,const Num n2)
{
    if(n1.rel < n2.rel)
    {
        return n1.rel<n2.rel;
    }
    else if(n1.rel == n2.rel)
    {
        return n1.vir<n2.vir;
    }
    return n1.rel<n2.rel;
}

bool Num::operator<=(const Num n2)
{
    if(this->rel < n2.rel)
    {
        return this->rel<n2.rel;
    }
    else if(this->rel == n2.rel)
    {
        return this->vir<=n2.vir;
    }
    return this->rel<n2.rel;
}

bool Num::operator==(const Num n2)
{
    if(this->rel == n2.rel)
    {
        return this->vir==n2.vir;
    }
    return this->rel==n2.rel;
}

bool Num::operator!=(const Num n2)
{
    if(this->rel != n2.rel)
    {
        return this->rel!=n2.rel;
    }
    else if(this->rel == n2.rel)
    {
        return this->vir!=n2.vir;
    }
    return this->rel!=n2.rel;
}

bool operator&&(const Num n1,const Num n2)
{
    return (n1.rel&&n2.rel)&&(n1.vir&&n2.vir);
}
bool operator||(const Num n1,const Num n2)
{
    return (n1.rel||n2.rel)||(n1.vir||n2.vir);
}
bool operator!(const Num n2)
{
    if(!n2.rel)
    {
        return 1;
    }
    return 0;
}

int main()
{
    return 0;
}

  • 2
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

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

余额充值