结构-06. 复数四则运算
2015-07-12 17:53
344 查看
import java.text.DecimalFormat; import java.util.Scanner; public class Main { /** * 结构-06. 复数四则运算 */ public static void main(String[] args) { Scanner s = new Scanner(System.in); double a1 = s.nextDouble(); double b1 = s.nextDouble(); double a2 = s.nextDouble(); double b2 = s.nextDouble(); DecimalFormat format = new DecimalFormat("#0.0"); String fa1 = format.format(a1); String fb1 = format.format(b1); String fa2 = format.format(a2); String fb2 = format.format(b2); String output = null; // *********加法***********/ double result1 = a1 + a2; double result2 = b1 + b2; String fs1 = format.format(result1); String fs2 = format.format(result2); if (fs1.equals("-0.0")) { fs1 = "0.0"; } if (fs2.equals("-0.0")) { fs2 = "0.0"; } String str1 = "(" + fa1 + (b1 >= 0 ? "+" : "") + fb1 + "i) "; String str2 = " (" + fa2 + (b2 >= 0 ? "+" : "") + fb2 + "i) = "; String str = str1 + "+" + str2; if (fs1.equals("0.0") && !fs2.equals("0.0")) { output = str + fs2 + "i"; } else if (fs2.equals("0.0")) { output = str + fs1; } else { if (result2 < 0) { output = str + fs1 + fs2 + "i"; } else { output = str + fs1 + "+" + fs2 + "i"; } } System.out.println(output); // *********减法***********/ result1 = a1 - a2; result2 = b1 - b2; fs1 = format.format(result1); fs2 = format.format(result2); if (fs1.equals("-0.0")) { fs1 = "0.0"; } if (fs2.equals("-0.0")) { fs2 = "0.0"; } str = str1 + "-" + str2; if (fs1.equals("0.0") && !fs2.equals("0.0")) { output = str + fs2 + "i"; } else if (fs2.equals("0.0")) { output = str + fs1; } else { if (result2 < 0) { output = str + fs1 + fs2 + "i"; } else { output = str + fs1 + "+" + fs2 + "i"; } } System.out.println(output); // *********乘法***********/ result1 = a1 * a2 - b1 * b2; result2 = a1 * b2 + a2 * b1; fs1 = format.format(result1); fs2 = format.format(result2); if (fs1.equals("-0.0")) { fs1 = "0.0"; } if (fs2.equals("-0.0")) { fs2 = "0.0"; } str = str1 + "*" + str2; if (fs1.equals("0.0") && !fs2.equals("0.0")) { output = str + fs2 + "i"; } else if (fs2.equals("0.0")) { output = str + fs1; } else { if (result2 < 0) { output = str + fs1 + fs2 + "i"; } else { output = str + fs1 + "+" + fs2 + "i"; } } System.out.println(output); // *********除法***********/ result1 = (a1 * a2 + b1 * b2) / (a2 * a2 + b2 * b2); result2 = (a2 * b1 - a1 * b2) / (a2 * a2 + b2 * b2); fs1 = format.format(result1); fs2 = format.format(result2); if (fs1.equals("-0.0")) { fs1 = "0.0"; } if (fs2.equals("-0.0")) { fs2 = "0.0"; } str = str1 + "/" + str2; if (fs1.equals("0.0") && !fs2.equals("0.0")) { output = str + fs2 + "i"; } else if (fs2.equals("0.0")) { output = str + fs1; } else { if (result2 < 0) { output = str + fs1 + fs2 + "i"; } else { output = str + fs1 + "+" + fs2 + "i"; } } System.out.println(output); } }
相关文章推荐
- Samung Galaxy III I535 黑砖救活经过
- 高效的oracle模糊查询SQL
- iOS --- 去掉UITableView中的空白行
- 数据结构与算法之二叉搜索树
- 读取kafka 0.8 简单例子
- 文章标题
- 进程中多线程共享变量
- Unity3D之空间转换学习笔记(一):场景物体变换
- Java 自定义注解释义
- IOS 枚举类型
- 新手入门如何系统地学习数据挖掘
- SSH框架搭建及配置文件
- JSP中EL表达式入门与简介
- Java运行过程
- 数组-13. 螺旋方阵
- 微型直线推杆的拆解及分析
- BZOJ 1984: 月下“毛景树”( 树链剖分 )
- [leetcode] 148.Sort List
- c++学习-特殊类成员
- iOS基础(foundation)-反射