這個問題在這里已經有了答案： 尋找最接近 0 的數字 (28 個答案) 7 小時前關閉。
晚上好，目前我被困在這個作業問題上：
Print out the double that is closest to 0, positive or negative.
我目前的代碼是：
import java.util.Arrays;
import java.util.Scanner;
public class Code {
public static void main(String[] args){
Scanner scanner = new Scanner(System.in);
// Read input for the test cases
int N = scanner.nextInt();
double[] doubles = new double[N];
double closestToZero = N;
for(int i = 0; i < N; i ) {
doubles[i] = scanner.nextDouble();
}
// Your code here
for(int a = 0; a < N; a ) {
if (Math.abs(a) < 0) {
closestToZero = a;
}
else if(Math.abs(a) == 0.0) {
closestToZero = a;
}
else {
}
}
System.out.println("The double closest to 0 is " closestToZero);
}
}
問題：即使答案不正確，代碼仍然列印出 0.0，錯誤的原因是什么？
uj5u.com熱心網友回復：
最接近 0 是絕對值中的最小數。然后你只需要找到最小值。如果找到較小的數字，則更新最接近零。
import java.util.Arrays;
import java.util.Scanner;
public class Code {
public static void main(String[] args){
Scanner scanner = new Scanner(System.in);
// Read input for the test cases
int N = scanner.nextInt();
double[] doubles = new double[N];
double closestToZero = Double.MAX_VALUE;
for(int i = 0; i < N; i ) {
doubles[i] = scanner.nextDouble();
}
// Your code here
for(int a = 0; a < N; a ) {
if (Math.abs(doubles[a]) < Math.abs(closestToZero)) {
closestToZero = doubles[a];
}
}
System.out.println("The double closest to 0 is " closestToZero );
}
}
uj5u.com熱心網友回復：
這是一種從 Double[] 陣列中找到接近于零的值的更快、更有效的方法。如果您有任何問題，請告訴我，不要忘記接受答案！
import java.util.Arrays;
import java.util.Scanner;
public class StackOverflow_Tester {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
System.out.println("Enter number of integers: ");
int N = in.nextInt();
double[] doubles = new double[N];
for(int i = 0; i < N; i ) {
doubles[i] = in.nextDouble();
}
double curr = 0;
double near = doubles[0];
// find the element nearest to zero
for ( int i=0; i < doubles.length; i ){
curr = doubles[i] * doubles[i];
if ( curr <= (near * near) ) {
near = doubles[i];
}
}
System.out.println( near );
}
}
轉載請註明出處，本文鏈接：https://www.uj5u.com/caozuo/435878.html