10.19（周四）

最新推荐文章于 2023-11-04 19:08:23 发布

yoda012110

最新推荐文章于 2023-11-04 19:08:23 发布

阅读量174

点赞数

本文链接：https://blog.csdn.net/yoda012110/article/details/78289950

版权

package 复数;

class Complex{
    public int x;
    public int y;
    
    public Complex(){
        this.x = 0;
        this.y = 0;
    }
    
    public Complex(int x, int y){
        this.x = x;
        this.y = y;
    }
    
    public void showComp(){
        if(this.y !=0){
            if(this.y > 0){
                System.out.println(this.x + "+" + this.y + "i");
            }
            else{
                System.out.println(this.x + "-" + this.y + "i");
            }            
        }
        else{
                System.out.println(this.x);
        }
    }
    
    public Complex addComp(Complex C1,Complex C2){    
        Complex re = new Complex();
        re.x = C1.x+C2.x;
        re.y = C1.y+C2.y;
        re.showComp();
        return re;
        
        //return new Complex(C1.x+C2.x, C1.y+C2.y);        
    }
    
    public Complex sulComp(Complex C1,Complex C2){    
        Complex re = new Complex();
        re.x = C1.x - C2.x;
        re.y = C1.y - C2.y;
        re.showComp();
        return re;
        // return new Complex(C1.x-C2.x, C1.y-C2.y);        
    }
    
    public Complex multiComp(Complex C1,Complex C2){
        Complex re = new Complex();
        re.x = (C1.x * C2.x - C1.y * C2.y);
        re.y = (C1.x * C2.y + C1.y * C2.x);
        re.showComp();
        return re;
        //return new Complex((C1.x * C2.x - C1.y * C2.y) , (C1.x * C2.y + C1.y * C2.x));
    }
    
    public boolean equalComp(Complex C1,Complex C2){
        if(C1.equals(C2)){
            System.out.println("相等");
            return true;
        }
        return false;
    }
}



public class Fushu {
    public static void main(String[] args){
        Complex num1 = new Complex(3, 5); 
        Complex num2 = new Complex(7, 8);
        Complex num3 = new Complex();
        
        
        num1.showComp();
        num2.showComp();
        
        num3.addComp(num1, num2);
        num3.sulComp(num1, num2);
        num3.multiComp(num1, num2);
        num3.equalComp(num1, num2);
    }
}

package的用法

<!DOCTYPE html >  
  
<html xmlns="http://www.w3.org/1999/xhtml">  
<head id="Head1" runat="server">  
 
    <title>无标题页</title>  
</head>  
 
  <body style="text-align:center">
    <form id="form2" runat="server">
    <div>
百度网站的超级链接
<a href="http:\\www.baidu.com"> 百度搜索</a><br/>                
  </div>
   </form>
</body>  
</html>

yoda012110

关注

0
点赞
踩
0

收藏

觉得还不错? 一键收藏
0
评论
10.19（周四）

package 复数;class Complex{ public int x; public int y; public Complex(){ this.x = 0; this.y = 0; } public Complex(int x, int y){ this.x = x;
复制链接

扫一扫