Java里n1,n2做减法运算
时间: 2023-09-12 19:12:12 浏览: 123
在Java中,可以使用减法运算符“-”进行n1和n2的减法运算,示例如下:
```
int n1 = 5;
int n2 = 3;
int result = n1 - n2; // result的值为2
```
如果n1和n2是其他类型的数值,也可以使用相应的减法运算符或相关方法进行减法运算。例如,如果n1和n2是double类型的数值,可以使用减法运算符“-”进行减法运算,示例如下:
```
double n1 = 5.0;
double n2 = 3.0;
double result = n1 - n2; // result的值为2.0
```
需要注意的是,对于浮点数的减法运算,由于浮点数的精度问题,可能会出现舍入误差,因此在进行精确计算时,建议使用BigDecimal类。
相关问题
将以下代码改错:import java.math.*; class BigIntegerExample { public static void main(String args[]) { BigInteger n1=new BigInteger("987654321987654321987654321"), n2=new BigInteger("123456789123456789123456789"), result=null; result=【代码1】//n1和n2做加法运算 System.out.println("和:"+result.toString()); result=【代码2】//n1和n2做减法运算 System.out.println("差:"+result.toString()); result=【代码3】//n1和n2做乘法运算 System.out.println("积:"+result.toString()); result=【代码4】//n1和n2做除法运算 System.out.println("商:"+result.toString()); BigInteger m=new BigInteger("1968957"), COUNT=new BigInteger("0"), ONE=new BigInteger("1"), TWO=new BigInteger("2"); System.out.println(m.toString()+"的因子有:"); for(BigInteger i=TWO;i.compareTo(m)<0;i=i.add(ONE)) { if((n1.remainder(i).compareTo(BigInteger.ZERO))==0) { COUNT=COUNT.add(ONE); System.out.print(" "+i.toString()); } } System.out.println(""); System.out.println(m.toString()+"一共有"+COUNT.toString()+"个因子"); } }
import java.math.*;
class BigIntegerExample {
public static void main(String args[]) {
BigInteger n1 = new BigInteger("987654321987654321987654321"),
n2 = new BigInteger("123456789123456789123456789"),
result = null;
result = n1.add(n2); //n1和n2做加法运算
System.out.println("和:" + result.toString());
result = n1.subtract(n2); //n1和n2做减法运算
System.out.println("差:" + result.toString());
result = n1.multiply(n2); //n1和n2做乘法运算
System.out.println("积:" + result.toString());
result = n1.divide(n2); //n1和n2做除法运算
System.out.println("商:" + result.toString());
BigInteger m = new BigInteger("1968957"),
COUNT = new BigInteger("0"),
ONE = new BigInteger("1"),
TWO = new BigInteger("2");
System.out.println(m.toString() + "的因子有:");
for (BigInteger i = TWO; i.compareTo(m) < 0; i = i.add(ONE)) {
if ((m.remainder(i).compareTo(BigInteger.ZERO)) == 0) {
COUNT = COUNT.add(ONE);
System.out.print(" " + i.toString());
}
}
System.out.println("");
System.out.println(m.toString() + "一共有" + COUNT.toString() + "个因子");
}
}
帮我完善这个代码import java.math.*; class BigIntegerExample { public static void main(String args[]) { BigInteger n1=new BigInteger("987654321987654321987654321"), n2=new BigInteger("123456789123456789123456789"), result=null; result= //【代码1】//n1和n2做加法运算 System.out.println("和:"+result.toString()); result= // 【代码2】//n1和n2做减法运算 System.out.println("差:"+result.toString()); result= //【代码3】//n1和n2做乘法运算 System.out.println("积:"+result.toString()); result= //【代码4】//n1和n2做除法运算 System.out.println("商:"+result.toString()); BigInteger m=new BigInteger("1968957"), COUNT=new BigInteger("0"), ONE=new BigInteger("1"), TWO=new BigInteger("2"); System.out.println(m.toString()+"的因子有:"); for(BigInteger i=TWO;i.compareTo(m)<0;i=i.add(ONE)) { if((n1.remainder(i).compareTo(BigInteger.ZERO))==0) { COUNT=COUNT.add(ONE); System.out.print(" "+i.toString()); } } System.out.println(""); System.out.println(m.toString()+"一共有"+COUNT.toString()+"个因子"); } }
好的,我来完善一下这个代码。以下是完整的代码:
import java.math.*;
class BigIntegerExample {
public static void main(String args[]) {
BigInteger n1 = new BigInteger("987654321987654321987654321");
BigInteger n2 = new BigInteger("123456789123456789123456789");
BigInteger result = null;
// n1和n2做加法运算
result = n1.add(n2);
System.out.println("和:" + result.toString());
// n1和n2做减法运算
result = n1.subtract(n2);
System.out.println("差:" + result.toString());
// n1和n2做乘法运算
result = n1.multiply(n2);
System.out.println("积:" + result.toString());
// n1和n2做除法运算
result = n1.divide(n2);
System.out.println("商:" + result.toString());
BigInteger m = new BigInteger("1968957");
BigInteger COUNT = new BigInteger("0");
BigInteger ONE = new BigInteger("1");
BigInteger TWO = new BigInteger("2");
System.out.println(m.toString() + "的因子有:");
for (BigInteger i = TWO; i.compareTo(m) < 0; i = i.add(ONE)) {
if ((m.remainder(i).compareTo(BigInteger.ZERO)) == 0) {
COUNT = COUNT.add(ONE);
System.out.print(" " + i.toString());
}
}
System.out.println("");
System.out.println(m.toString() + "一共有" + COUNT.toString() + "个因子");
}
}
我主要是完善了代码中的四个部分,即:
- 代码1:将n1和n2相加,用add方法实现。
- 代码2:将n1和n2相减,用subtract方法实现。
- 代码3:将n1和n2相乘,用multiply方法实现。
- 代码4:将n1除以n2,用divide方法实现。
此外,我还稍作修改了代码中的一些细节,使其更加规范易读。希望这对您有所帮助。
相关推荐
![pdf](https://img-home.csdnimg.cn/images/20210720083512.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![zip](https://img-home.csdnimg.cn/images/20210720083736.png)