1 Star 0 Fork 0

Cai7 / cwc20162328_JavaFoundations2nd

加入 Gitee
与超过 1200万 开发者一起发现、参与优秀开源项目,私有仓库也完全免费 :)
免费加入
该仓库未声明开源许可证文件(LICENSE),使用请关注具体项目描述及其代码上游依赖。
克隆/下载
ComplexNumber.java 1.95 KB
一键复制 编辑 原始数据 按行查看 历史
提交于 2017-05-10 21:11 . mima
package test;
/**
* Created by dell on 2017/5/9.
*/
public class ComplexNumber {
public int i;
public double a, b,m;
static public double W, X, Y;
static public String Z,z,s;
public ComplexNumber(){
}
public ComplexNumber(double A, double B){
this.a = A;
this.b = B;
}
public void Show(){
s = "z = " + a + " + " + b +"i";
System.out.println("Show a complex number:"+ s );
}
public static void Count(ComplexNumber C1,char C2,ComplexNumber C3){
switch (C2){
case '+' :
X = C1.a + C3.a;
Y = C1.b + C3.b;
Z = "("+X+")" + "+" + "("+Y+")" + "i";
break;
case '-' :
X = C1.a - C3.a;
Y = C1.b - C3.b;
Z = "("+X+")" + "+" + "("+Y+")" + "i";
break;
case '*' :
X = C1.a * C3.a - C1.b * C3.b;
Y = C1.b * C3.a + C1.a * C3.b;
Z = "("+X+")" + "+" + "("+Y+")" + "i";
break;
case '/' :
W = Math.pow(C3.a,2)+Math.pow(C3.b,2);
X = (C1.a * C3.a + C1.b * C3.b)/W;
Y = (C1.b * C3.a - C1.a * C3.b)/W;
Z = "("+X+")" + "+" + "("+Y+")" + "i";
break;
default:
System.out.println("The input is not a valid operator!");
}
}
public void Length(){
if (b != 0){
double s = (int)Math.pow(a, 2)+Math.pow(b, 2);
m = Math.sqrt(s);
}
else
if(a>=0)
m = this.a;
else
m = this.a * -1;
System.out.println("This complex number length is: " + m);
}
public static String getCount(){
return Z;
}
public String toString(){
z = "("+a+")" + "+" + "("+b+")" + "i";
return z;
}
}
1
https://gitee.com/Cai7/cwc20162328_JavaFoundations2nd.git
git@gitee.com:Cai7/cwc20162328_JavaFoundations2nd.git
Cai7
cwc20162328_JavaFoundations2nd
cwc20162328_JavaFoundations2nd
master

搜索帮助