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

Add kaprekarNumberInRange (#2894)

Browse Source 
Co-authored-by: Andrii Siriak <siryaka@gmail.com>
This commit is contained in:
Subhro Acharjee
2022-01-08 01:20:32 +05:30
committed by GitHub
parent 97dfbfd67f
commit a0a392297e
1 changed files with 16 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -1,4 +1,5 @@
package com.thealgorithms.maths;
import java.util.*;
public class KaprekarNumbers {
@ -6,15 +7,27 @@ public class KaprekarNumbers {
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
// Provides a list of kaprekarNumber in a range
public static ArrayList<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<>();
public static boolean isKaprekarNumber(long number) {
for (long i = start; i <= end; i++) {
if (isKaprekarNumber(i)) list.add(i);
}
return list;
}
// 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;
long leftDigits1 = 0, leftDigits2;
if(Long.toString(numberSquared).contains("0")){
leftDigits1 = Long.parseLong(Long.toString(numberSquared).substring(0, Long.toString(numberSquared).indexOf("0")));
}