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

Add Kaprekar Numbers (#2881)

Browse Source
This commit is contained in:
s-devran
2021-12-15 17:55:04 +03:00
committed by GitHub
parent b1242e045b
commit 98656cb0cd
2 changed files with 85 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

27
src/main/java/com/thealgorithms/maths/KaprekarNumbers.java Normal file
View File

@ -0,0 +1,27 @@
package com.thealgorithms.maths;
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. */
// Checks whether a given number is Kaprekar Number or not
public static boolean isKaprekarNumber(long number) {
long numberSquared = number * number;
if(Long.toString(number).length() == Long.toString(numberSquared).length()){
return (number == numberSquared);
}
else{
long leftDigits1 = 0, leftDigits2 = 0;
if(Long.toString(numberSquared).contains("0")){
leftDigits1 = Long.parseLong(Long.toString(numberSquared).substring(0, Long.toString(numberSquared).indexOf("0")));
}
leftDigits2 = Long.parseLong(Long.toString(numberSquared).substring(0, (Long.toString(numberSquared).length() - Long.toString(number).length())));
long rightDigits = Long.parseLong(Long.toString(numberSquared).substring(Long.toString(numberSquared).length() - Long.toString(number).length()));
return (number == (leftDigits1 + rightDigits)) || (number == (leftDigits2 + rightDigits));
}
}
}