A diamond where every row counts up to its middle and back down again. Below you will see how the pattern is built, followed by complete programs in C, C++, Java and Python.
This program is part of the Number Patterns collection.
Table of contents7 sections
Palindrome Number Diamond output
Output (n = 5):
1
121
12321
1234321
123454321
1234321
12321
121
1
How the palindrome number diamond works
Each row is a palindrome: 1 up to i, then i − 1 down to 1. The second half repeats the rows in reverse order, starting at n − 1.
- Run the outer loop for
ifrom1ton, one row per pass (upper half). - Print
n − ispaces. - Print
inumbers (valuej). - Print
i − 1numbers (valuei − j). - Move to the next line.
- Run the outer loop for
ifromn − 1down to1, one row per pass (lower half). - Print
n − ispaces. - Print
inumbers (valuej). - Print
i − 1numbers (valuei − j). - Move to the next line.
Palindrome Number Diamond in C
#include <stdio.h>
int main(void) {
int n = 5;
// upper half
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n - i; j++)
printf(" ");
for (int j = 1; j <= i; j++)
printf("%d", j);
for (int j = 1; j <= i - 1; j++)
printf("%d", i - j);
printf("\n");
}
// lower half
for (int i = n - 1; i >= 1; i--) {
for (int j = 1; j <= n - i; j++)
printf(" ");
for (int j = 1; j <= i; j++)
printf("%d", j);
for (int j = 1; j <= i - 1; j++)
printf("%d", i - j);
printf("\n");
}
return 0;
}Palindrome Number Diamond in C++
#include <iostream>
using namespace std;
int main() {
int n = 5;
// upper half
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n - i; j++)
cout << " ";
for (int j = 1; j <= i; j++)
cout << j;
for (int j = 1; j <= i - 1; j++)
cout << i - j;
cout << endl;
}
// lower half
for (int i = n - 1; i >= 1; i--) {
for (int j = 1; j <= n - i; j++)
cout << " ";
for (int j = 1; j <= i; j++)
cout << j;
for (int j = 1; j <= i - 1; j++)
cout << i - j;
cout << endl;
}
return 0;
}Palindrome Number Diamond in Java
public class PalindromeNumberDiamond {
public static void main(String[] args) {
int n = 5;
// upper half
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n - i; j++)
System.out.print(" ");
for (int j = 1; j <= i; j++)
System.out.print(j);
for (int j = 1; j <= i - 1; j++)
System.out.print(i - j);
System.out.println();
}
// lower half
for (int i = n - 1; i >= 1; i--) {
for (int j = 1; j <= n - i; j++)
System.out.print(" ");
for (int j = 1; j <= i; j++)
System.out.print(j);
for (int j = 1; j <= i - 1; j++)
System.out.print(i - j);
System.out.println();
}
}
}Palindrome Number Diamond in Python
n = 5
# upper half
for i in range(1, n + 1):
for j in range(1, n - i + 1):
print(" ", end="")
for j in range(1, i + 1):
print(j, end="")
for j in range(1, i):
print(i - j, end="")
print()
# lower half
for i in range(n - 1, 0, -1):
for j in range(1, n - i + 1):
print(" ", end="")
for j in range(1, i + 1):
print(j, end="")
for j in range(1, i):
print(i - j, end="")
print()Time and space complexity
The program prints one character for each position in the pattern, so for n rows it runs in O(n²) time. It only needs a few loop variables, so the extra memory is O(1).









