zoukankan      html  css  js  c++  java
  • 用类的友元函数完成运算符的重载

    /* 
    
    * 程序的版权和版本声明部分 
    
    * Copyright (c)2012, 烟台大学计算机学院学生 
    
    * All rightsreserved. 
    
    * 文件名称: object.cpp 
    
    * 作者:刘清远
    
    * 完成日期: 2013年 4 月 22 日 
    
    * 版本号: v1.0 
    
    * 输入描述:无
    
     * 问题描述: 
    
    * 程序输出: 
    
    */  
    
    #include <iostream>
    using namespace std;
    class Complex
    {public:
    Complex(){real=0;imag=0;}
    Complex(double r,double i){real=r;imag=i;}
    Complex operator+(Complex &c2);
    Complex operator-(Complex &c2);
    Complex operator*(Complex &c2);
    Complex operator/(Complex &c2);
    void display();
    private:
    double real;
    double imag;
    };
    Complex Complex::operator +(Complex&c2) 
    {
     return Complex(real+c2.real,imag+c2.imag);
    }
    Complex Complex::operator-(Complex&c2)
    {
     return Complex(real-c2.real,imag-c2.imag);
    }
    Complex Complex::operator *(Complex&c2)
    {
     return Complex(real*c2.real+imag*c2.imag,real*c2.imag+imag*c2.real);
    }
    Complex Complex::operator /(Complex&c2)
    {
     return Complex((real*c2.real+imag*c2.imag)/(c2.real*c2.real+c2.imag*c2.imag),(imag*c2.real-real*c2.imag)/(c2.real*c2.real+c2.imag*c2.imag));  
    }
    void Complex::display()
    {
    cout<<"("<<real<<","<<imag<<"i)"<<endl;
    }
    int main()
    {
     Complex c1(3,4),c2(5,-10),c3;
     cout<<"c1=";
     c1.display();
     cout<<"c2=";
     c2.display();
     c3=c1+c2;
     cout<<"c1+c2=";
     c3.display();
     c3=c1-c2;
     cout<<"c1-c2=";
     c3.display();
     c3=c1*c2;
     cout<<"c1*c2=";
     c3.display();
     c3=c1/c2;
     cout<<"c1/c2=";
     c3.display();
     system ("pause");
     return 0;
    } 
    
    


  • 相关阅读:
    [ css 计数器 counter ] css中counter计数器实例演示三
    [ css 计数器 counter ] css中counter计数器实例演示二
    Leetcode 15. 三数之和
    Leetcode 13. 罗马数字转整数
    Leetcode 19. 删除链表的倒数第 N 个结点
    Leetcode 12. 整数转罗马数字
    Leetcode 11. 盛最多水的容器 双指针
    剑指 Offer 68
    剑指 Offer 68
    面试题 04.02. 最小高度树
  • 原文地址:https://www.cnblogs.com/javawebsoa/p/3036575.html
Copyright © 2011-2022 走看看