algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-07-26 14:04:17 +08:00
Code Issues Packages Projects Releases Wiki Activity

style: format code (#4212)

Browse Source 
close #4204
This commit is contained in:
acbin
2023-06-09 18:52:05 +08:00
committed by GitHub
parent ad03086f54
commit 00282efd8b
521 changed files with 5233 additions and 7309 deletions
Download Patch File Download Diff File Expand all files Collapse all files

39
src/main/java/com/thealgorithms/maths/KaprekarNumbers.java
View File

@ -6,12 +6,12 @@ import java.util.*;
public class KaprekarNumbers {
/* This program demonstrates if a given number is Kaprekar Number or not.
Kaprekar Number: A Kaprekar number is an n-digit number which its square can be split into two parts where the right part has n
digits and sum of these parts is equal to the original number. */
Kaprekar Number: A Kaprekar number is an n-digit number which its square can be split into
two parts where the right part has n digits and sum of these parts is equal to the original
number. */
// Provides a list of kaprekarNumber in a range
public static List<Long> kaprekarNumberInRange(long start, long end)
throws Exception {
public static List<Long> kaprekarNumberInRange(long start, long end) throws Exception {
long n = end - start;
if (n < 0) throw new Exception("Invalid range");
ArrayList<Long> list = new ArrayList<>();
@ -34,32 +34,13 @@ public class KaprekarNumbers {
BigInteger leftDigits1 = BigInteger.ZERO;
BigInteger leftDigits2;
if (numberSquared.toString().contains("0")) {
leftDigits1 =
new BigInteger(
numberSquared
.toString()
.substring(0, numberSquared.toString().indexOf("0"))
);
leftDigits1 = new BigInteger(
numberSquared.toString().substring(0, numberSquared.toString().indexOf("0")));
}
leftDigits2 =
new BigInteger(
numberSquared
.toString()
.substring(
0,
(
numberSquared.toString().length() -
number.length()
)
)
);
BigInteger rightDigits = new BigInteger(
numberSquared
.toString()
.substring(
numberSquared.toString().length() - number.length()
)
);
leftDigits2 = new BigInteger(numberSquared.toString().substring(
0, (numberSquared.toString().length() - number.length())));
BigInteger rightDigits = new BigInteger(numberSquared.toString().substring(
numberSquared.toString().length() - number.length()));
String x = leftDigits1.add(rightDigits).toString();
String y = leftDigits2.add(rightDigits).toString();
return (number.equals(x)) || (number.equals(y));