Zygodromes in Java

A positive number that is made by the identical digits running non-trivially is Zygodrome. It means if identical digits will always come together (in pairs) in the number, then that number is known as Zygodrome. Zyg is a Greek word, and its meaning is union or pair.

Example: 1

Input:

Int n = 99

Output: 99 is a Zygodrome.

Explanation: In the number 99, the digit 9 is occurring in pairs. Hence, the number 99 is Zygodrome.

Example: 2

Input:

int n = 909

Output: 909 is not a Zygodrome.

Explanation: In the number 909, the digit 9 is not occurring in pairs. There is a digit 0 between two nines. Hence, the number 909 is not Zygodrome.

Example: 3

Input:

int n = 1100

Output: 1100 is a Zygodrome.

Explanation: In the number 1100, the digit 1 is occurring in pairs, and 0 is also occurring in pairs. Hence, the number 1100 is Zygodrome.

Example: 4

Input:

int n = 4224

Output: 4224 is not a Zygodrome.

Explanation: In the number 4224, the digit 4 is not occurring in pairs as a pair of 2 is there in between two fours. Hence, the number 4224 is not Zygodrome.

Example: 5

Input:

int n = 442244

Output: 442244 is a Zygodrome.

Explanation: In the number 442244, the digit 4 is occurring in pairs, and the digit 2 is also occurring in a pair. Hence, the number 442244 is a Zygodrome.

Approach: Using While Loop

We can use a while loop. The while loop will traverse the digits of the given number and will check whether the number is Zygodrome or not with the help of an auxiliary array.

FileName: Zygodromes.java

public class Zygodromes 
{
// a method that checks whether the number n is Zygodrome or not
public boolean isZygodromes(int n)
{
// an array that stores the number of occurrences of each digit
// in the number n
int dig[] = new int[10];

// loop that traverses the digits of the number n
// the traversal occurs for the rightmost digit to the 
// left most digit
while(n != 0)
{
// counts the occurrence of the same digit in the
// number n
int countSameDig = 0;

// finds the current digit
int currDig = n % 10;
int temp = currDig;

while(currDig == temp )
{
countSameDig = countSameDig + 1;
n = n / 10;
temp = n % 10;

}

// no digit in Zygodrome should come only once
if(countSameDig == 1)
{
return false;
}

// store the number of occurrences of the digit 
// in the auxiliary array
dig[currDig] = countSameDig;

countSameDig = 0;

}

// if the control reaches here, then it means
// the number n is a Zygodrome
return true;
}

// main method
public static void main(String argvs[]) 
{
// creating an object of the class Zygodromes
Zygodromes obj = new Zygodromes();

// input 1
int inputNum = 99;
// invoking the method isZygodromes and storing the result
boolean isZygodrome = obj.isZygodromes(inputNum);
if(isZygodrome)
{
System.out.println("The number " + inputNum + " is a Zygodrome.");
}
else
{
System.out.println("The number " + inputNum + " is not a Zygodrome.");
}

System.out.println();

// input 2
inputNum = 909;
// invoking the method isZygodromes and storing the result
isZygodrome = obj.isZygodromes(inputNum);
if(isZygodrome)
{
System.out.println("The number " + inputNum + " is a Zygodrome.");
}
else
{
System.out.println("The number " + inputNum + " is not a Zygodrome.");
}

System.out.println();

// input 3
inputNum = 1100;
// invoking the method isZygodromes and storing the result
isZygodrome = obj.isZygodromes(inputNum);
if(isZygodrome)
{
System.out.println("The number " + inputNum + " is a Zygodrome.");
}
else
{
System.out.println("The number " + inputNum + " is not a Zygodrome.");
}

System.out.println();

// input 4
inputNum = 4224;
// invoking the method isZygodromes and storing the result
isZygodrome = obj.isZygodromes(inputNum);
if(isZygodrome)
{
System.out.println("The number " + inputNum + " is a Zygodrome.");
}
else
{
System.out.println("The number " + inputNum + " is not a Zygodrome.");
}

System.out.println();

// input 5
inputNum = 442244;
// invoking the method isZygodromes and storing the result
isZygodrome = obj.isZygodromes(inputNum);
if(isZygodrome)
{
System.out.println("The number " + inputNum + " is a Zygodrome.");
}
else
{
System.out.println("The number " + inputNum + " is not a Zygodrome.");
}

}
}

Output:

The number 99 is a Zygodrome.

The number 909 is not a Zygodrome.

The number 1100 is a Zygodrome.

The number 4224 is not a Zygodrome.

The number 442244 is a Zygodrome.

Complexity Analysis: The program is using two nested while-loops. However, the inner loop is also traversing the digits of the input number and also reducing the input number. Therefore, the time complexity of the program is O(d), where d is the total number of digits present in the input number. The program is using an auxiliary array. However, the size of the auxiliary array is constant. Hence, the space complexity of the program is O(1).

Approach: Using String

We can convert the input number into a string and can then make the comparison of the current, next, and previous characters of the string to check whether they are the same or not. It can be achieved using a single loop. See the following program.

FileName: Zygodromes.java

public class Zygodromes 
{
// a method that checks whether the number n is Zygodrome or not
public boolean isZygodromes(int n)
{
// converting the number n to string
String tmp = Integer.toString(n);

// Adding the space at the end and 
// beginning of the string
tmp = ' ' + tmp + ' ';

// Traversing the string tmp 
for (int k = 1; k < tmp.length() - 1; k++)
{
// If any character is not the same as
// previous or next then return false value
if (tmp.charAt(k) != tmp.charAt(k - 1) && tmp.charAt(k) != tmp.charAt(k + 1))
{
return false;
}
}
return true;
}

// main method
public static void main(String argvs[]) 
{
// creating an object of the class Zygodromes
Zygodromes obj = new Zygodromes();

// input 1
int inputNum = 99;
// invoking the method isZygodromes and storing the result
boolean isZygodrome = obj.isZygodromes(inputNum);
if(isZygodrome)
{
System.out.println("The number " + inputNum + " is a Zygodrome.");
}
else
{
System.out.println("The number " + inputNum + " is not a Zygodrome.");
}

System.out.println();

// input 2
inputNum = 909;
// invoking the method isZygodromes and storing the result
isZygodrome = obj.isZygodromes(inputNum);
if(isZygodrome)
{
System.out.println("The number " + inputNum + " is a Zygodrome.");
}
else
{
System.out.println("The number " + inputNum + " is not a Zygodrome.");
}

System.out.println();

// input 3
inputNum = 1100;
// invoking the method isZygodromes and storing the result
isZygodrome = obj.isZygodromes(inputNum);
if(isZygodrome)
{
System.out.println("The number " + inputNum + " is a Zygodrome.");
}
else
{
System.out.println("The number " + inputNum + " is not a Zygodrome.");
}

System.out.println();

// input 4
inputNum = 4224;
// invoking the method isZygodromes and storing the result
isZygodrome = obj.isZygodromes(inputNum);
if(isZygodrome)
{
System.out.println("The number " + inputNum + " is a Zygodrome.");
}
else
{
System.out.println("The number " + inputNum + " is not a Zygodrome.");
}

System.out.println();

// input 5
inputNum = 442244;
// invoking the method isZygodromes and storing the result
isZygodrome = obj.isZygodromes(inputNum);
if(isZygodrome)
{
System.out.println("The number " + inputNum + " is a Zygodrome.");
}
else
{
System.out.println("The number " + inputNum + " is not a Zygodrome.");
}

}
}

Output:

The number 99 is a Zygodrome.

The number 909 is not a Zygodrome.

The number 1100 is a Zygodrome.

The number 4224 is not a Zygodrome.

The number 442244 is a Zygodrome.

Complexity Analysis: The time and space complexity of the program is the same as the previous one.

Next TopicElasticSearch Java API

← prev next →