给出复数,实现复数的四则运算
2015-06-12 22:28
375 查看
1.定义两个类——一个为complex,另外一个为complex_oper。计算功能在complex类中实现,方法分别为:public
static complex add(complex
t1,complex t2),public
static complex sub(complex
t1,complex t2),public
static complex multiply(complex
t1,complex t2),public
static complex divide(complex
t1,complex t2)。
2.给出两个复数的实部与虚部,调用相关方法就可以进行计算了。
class complex
{
double
a1;
double
b1;
public
double getA1() {
return
a1;
}
public
void setA1(double
a1) {
this.a1 =
a1;
}
public
double getB1() {
return
b1;
}
public
void setB1(double
b1) {
this.b1 =
b1;
}
public complex(double
a1, double
b1) {
super();
this.a1 =
a1;
this.b1 =
b1;
}
public
static complex add(complex t1,complex
t2)
{
complex t3= new complex(0, 0);
t3.a1=t1.a1+t2.a1;
t3.b1=t1.b1+t2.b1;
return
t3;
}
public
static complex sub(complex t1,complex
t2)
{
complex t3= new complex(0, 0);
t3.a1=t1.a1-t2.a1;
t3.b1=t1.b1-t2.b1;
return
t3;
}
public
static complex multiply(complex t1,complex
t2)
{
complex t3= new complex(0, 0);
t3.a1=t1.a1*t2.a1-t1.b1*t2.b1;
t3.b1=t1.a1*t2.b1+t2.a1*t1.b1;
return
t3;
}
public
static complex divide(complex t1,complex
t2)
{
complex t3= new complex(0, 0);
t3.a1=(t1.a1*t2.a1-t1.b1*t2.b1)/(t2.a1*t2.a1+t2.b1*t2.b1);
t3.b1=(t2.a1*t1.b1+t1.a1*t2.b1)/(t2.a1*t2.a1+t2.b1*t2.b1);
return
t3;
}
}
public
class complex_oper
{
public
static void main(String[]
args)
{
complex a=new complex(3,4);
complex b=new complex(2,1);
complex c;
c=complex.add(a,
b);
System.out.println("加法运算的结果为:c= " +
c.getA1() + "+ " +
c.getB1() + "*i");
System.out.println("此次的加法运算到此已完成!");
c=complex.sub(a,
b);
System.out.println("减法运算的结果为:c= " +
c.getA1() + "+ " +
c.getB1() + "*i");
System.out.println("此次的减法运算到此已完成!");
c=complex.multiply(a,
b);
System.out.println("乘法运算的结果为:c= " +
c.getA1() + "+ " +
c.getB1() + "*i");
System.out.println("此次的乘法运算到此已完成!");
c=complex.divide(a,
b);
System.out.println("除法运算的结果为:c= " +
c.getA1() + "+ " +
c.getB1() + "*i");
System.out.println("此次的除法运算到此已完成!");
}
}
static complex add(complex
t1,complex t2),public
static complex sub(complex
t1,complex t2),public
static complex multiply(complex
t1,complex t2),public
static complex divide(complex
t1,complex t2)。
2.给出两个复数的实部与虚部,调用相关方法就可以进行计算了。
class complex
{
double
a1;
double
b1;
public
double getA1() {
return
a1;
}
public
void setA1(double
a1) {
this.a1 =
a1;
}
public
double getB1() {
return
b1;
}
public
void setB1(double
b1) {
this.b1 =
b1;
}
public complex(double
a1, double
b1) {
super();
this.a1 =
a1;
this.b1 =
b1;
}
public
static complex add(complex t1,complex
t2)
{
complex t3= new complex(0, 0);
t3.a1=t1.a1+t2.a1;
t3.b1=t1.b1+t2.b1;
return
t3;
}
public
static complex sub(complex t1,complex
t2)
{
complex t3= new complex(0, 0);
t3.a1=t1.a1-t2.a1;
t3.b1=t1.b1-t2.b1;
return
t3;
}
public
static complex multiply(complex t1,complex
t2)
{
complex t3= new complex(0, 0);
t3.a1=t1.a1*t2.a1-t1.b1*t2.b1;
t3.b1=t1.a1*t2.b1+t2.a1*t1.b1;
return
t3;
}
public
static complex divide(complex t1,complex
t2)
{
complex t3= new complex(0, 0);
t3.a1=(t1.a1*t2.a1-t1.b1*t2.b1)/(t2.a1*t2.a1+t2.b1*t2.b1);
t3.b1=(t2.a1*t1.b1+t1.a1*t2.b1)/(t2.a1*t2.a1+t2.b1*t2.b1);
return
t3;
}
}
public
class complex_oper
{
public
static void main(String[]
args)
{
complex a=new complex(3,4);
complex b=new complex(2,1);
complex c;
c=complex.add(a,
b);
System.out.println("加法运算的结果为:c= " +
c.getA1() + "+ " +
c.getB1() + "*i");
System.out.println("此次的加法运算到此已完成!");
c=complex.sub(a,
b);
System.out.println("减法运算的结果为:c= " +
c.getA1() + "+ " +
c.getB1() + "*i");
System.out.println("此次的减法运算到此已完成!");
c=complex.multiply(a,
b);
System.out.println("乘法运算的结果为:c= " +
c.getA1() + "+ " +
c.getB1() + "*i");
System.out.println("此次的乘法运算到此已完成!");
c=complex.divide(a,
b);
System.out.println("除法运算的结果为:c= " +
c.getA1() + "+ " +
c.getB1() + "*i");
System.out.println("此次的除法运算到此已完成!");
}
}
相关文章推荐
- java对世界各个时区(TimeZone)的通用转换处理方法(转载)
- java-注解annotation
- java-模拟tomcat服务器
- java-用HttpURLConnection发送Http请求.
- java-WEB中的监听器Lisener
- Android IPC进程间通讯机制
- Android Native 绘图方法
- Android java 与 javascript互访(相互调用)的方法例子
- 介绍一款信息管理系统的开源框架---jeecg
- 聚类算法之kmeans算法java版本
- java实现 PageRank算法
- PropertyChangeListener简单理解
- 插入排序
- 冒泡排序
- 堆排序
- 快速排序
- 二叉查找树