Java语言程序设计与数据结构（基础篇）课后练习题 第十章（三）

public List Inspect(Integer[] val) {

for (int i : val) {

if (i % 2 == 0 || i % 3 == 0) {

list.add(i);

System.out.print(i + " ");

if (list.size() == 10) {

break;

}

continue;

}else{

continue;

}

}

return list;

}

}

10.17

==================================================================

import java.math.BigInteger;

public class dishizhang {

public static void main(String[] args) {

BigInteger[] max = new BigInteger[10];

long max1 = (long) Math.sqrt(Long.MAX_VALUE);

for (int i = 0; i < max.length; i++) {

BigInteger a = new BigInteger(max1 + i + 1 + “”);

max[i] = a.multiply(a);

}

System.out.println("The ten squares max value are: ");

for (int i = 0; i < max.length; i++) {

System.out.println(max[i]);

}

}

}

10.18

==================================================================

这个代码应该没错，但是运行时间太长了，没等到结果。。。。。。

import java.math.BigInteger;

public class dishizhang {

public static void main(String[] args) {

// TODO Auto-generated method stub

int count = 0;

BigInteger n = new BigInteger(Long.MAX_VALUE + “”);

while (count < 5) {

if (isPrime(n)) {

System.out.print(n + " ");

count++;

}

n = n.add(BigInteger.ONE);

}

}

public static boolean isPrime(BigInteger i) {

for (BigInteger divisor1 = new BigInteger(“2”); divisor1

.compareTo(i.divide(new BigInteger(“2”))) <= 0; divisor1 = divisor1.add(BigInteger.ONE)) {

if (i.remainder(divisor1).compareTo(BigInteger.ZERO) == 0)

return false;

}

return true;

}

}

10.19

==================================================================

import java.math.BigInteger;

public class dishizhang {

public static void main(String[] args) {

System.out.println(“p\t2^p-1”);

for (int i = 1; i <= 100; i++) {

BigInteger mersenne = new BigInteger(index(i) + “”);

BigInteger b1 = new BigInteger(i + “”);

if (isMersennePrime(i) && isPrime(b1)) {

System.out.print(b1);

System.out.print(“\t”);

System.out.println(mersenne);

}

}

}

public static boolean isPrime(BigInteger b) {

boolean r = true;

BigInteger b2 = new BigInteger(2 + “”);

if (b.equals(b2))

r = true;

else if (b.equals(new BigInteger(1 + “”)))

r = false;

else {

for (; b.compareTo(b2) == 1; b2 = b2.add(BigInteger.ONE)) {

if ((b.mod(b2)).equals(new BigInteger(0 + “”))) {

r = false;

continue;

}

}

}

return r;

}

public static boolean isMersennePrime(int i) {

boolean r2 = false;

if (isPrime(index(i)))

r2 = true;

return r2;

}

public static BigInteger index(int i) {

BigInteger i1 = new BigInteger(1 + “”);

BigInteger i2 = new BigInteger(2 + “”);

for (int b = 1; b <= i; b++) {

i1 = i1.multiply(i2);

}

BigInteger f = i1.subtract(BigInteger.ONE);

return f;

}

}

10.20

==================================================================

import java.math.BigDecimal;

import java.math.BigInteger;

public class dishizhang {

public static void main(String[] args) {

dishizhang computeE = new dishizhang();

for (int i=100;i<=1000;i+=100){

computeE.ComputeE(i);

}

}

public static BigDecimal factorial(int number) {

BigDecimal result=BigDecimal.valueOf(1L);

if (number==1){

return result;

}else {

for (int i=1;i<=number;i++){

BigDecimal iVal=BigDecimal.valueOf(i);

result=result.multiply(iVal);

}

return result;

}

}

public BigDecimal ComputeE(int index) {

BigDecimal result=BigDecimal.valueOf(1);

for (int i=1;i<=index;i++){

BigDecimal one=new BigDecimal(1);

BigDecimal tem=one.divide(factorial(i),25,BigDecimal.ROUND_UP);

result=result.add(tem);

}

System.out.println(“i:”+index+" e= "+result.toString());

return result;

}

}

10.21

==================================================================

这个代码应该也没有错误，还是没有等到答案，可能是运行时间太长。

import java.math.BigInteger;

public class dishizhang {

public static void main(String[] args) {

// TODO Auto-generated method stub

BigInteger n = new BigInteger(Long.MAX_VALUE + “”);

int count = 0;