mirror of
https://github.com/TheAlgorithms/Java.git
synced 2025-07-22 03:24:57 +08:00
Formatted with Google Java Formatter
This commit is contained in:
@ -3,27 +3,27 @@ package Maths;
|
||||
import java.util.Random;
|
||||
|
||||
public class Ceil {
|
||||
public static void main(String[] args) {
|
||||
Random random = new Random();
|
||||
for (int i = 1; i <= 1000; ++i) {
|
||||
double randomNumber = random.nextDouble();
|
||||
assert ceil(randomNumber) == Math.ceil(randomNumber);
|
||||
}
|
||||
public static void main(String[] args) {
|
||||
Random random = new Random();
|
||||
for (int i = 1; i <= 1000; ++i) {
|
||||
double randomNumber = random.nextDouble();
|
||||
assert ceil(randomNumber) == Math.ceil(randomNumber);
|
||||
}
|
||||
}
|
||||
|
||||
/**
|
||||
* Returns the smallest (closest to negative infinity)
|
||||
*
|
||||
* @param number the number
|
||||
* @return the smallest (closest to negative infinity) of given {@code number}
|
||||
*/
|
||||
public static double ceil(double number) {
|
||||
if (number - (int) number == 0) {
|
||||
return number;
|
||||
} else if (number - (int) number > 0) {
|
||||
return (int) (number + 1);
|
||||
} else {
|
||||
return (int) number;
|
||||
}
|
||||
/**
|
||||
* Returns the smallest (closest to negative infinity)
|
||||
*
|
||||
* @param number the number
|
||||
* @return the smallest (closest to negative infinity) of given {@code number}
|
||||
*/
|
||||
public static double ceil(double number) {
|
||||
if (number - (int) number == 0) {
|
||||
return number;
|
||||
} else if (number - (int) number > 0) {
|
||||
return (int) (number + 1);
|
||||
} else {
|
||||
return (int) number;
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
Reference in New Issue
Block a user