Given an integer n. You need to recreate the pattern given below for any value of N. Let's say for N = 5, the pattern should look like as below:
********** **** **** *** *** ** ** * * * * ** ** *** *** **** **** **********
Print the pattern in the function given to you.
iniS times. iniS starts at 0 and increases by 2 with each new row. Print stars again, mirroring the first set but in reverse order.#include <bits/stdc++.h>
using namespace std;
class Solution {
public:
//Function to print pattern19
void pattern19(int n) {
// Print the upper half pattern.
// Store the initial spaces.
int iniS = 0;
for(int i=0; i< n; i++){
//Printing the stars in the row.
for(int j = 1; j <= n-i; j++){
cout<<"*";
}
//Printing the spaces in the row.
for(int j = 0; j <iniS; j++){
cout<<" ";
}
//Printing the stars in the row.
for(int j = 1; j <= n-i; j++){
cout<<"*";
}
/* The spaces increase by 2
every time we hit a new row.*/
iniS+=2;
//Give a line break for a new row.
cout<<endl;
}
// Print the lower half pattern
// Store the initial spaces.
iniS = 2*n -2;
for(int i = 1; i <= n; i++){
//Printing the stars in the row.
for(int j = 1; j <= i; j++){
cout<<"*";
}
//Printing the spaces in the row.
for(int j = 0; j <iniS; j++){
cout<<" ";
}
//Printing the stars in the row.
for(int j = 1; j <= i; j++){
cout<<"*";
}
/* The spaces decrease by 2
every time we hit a new row.*/
iniS-=2;
//Give a line break for a new row.
cout<<endl;
}
}
};
int main() {
int N = 5;
//Create an instance of Solution class
Solution sol;
sol.pattern19(N);
return 0;
}
import java.util.*;
class Solution {
// Function to print pattern19
public void pattern19(int n) {
// Print the upper half pattern
// Store the initial spaces.
int iniS = 0;
for (int i = 0; i < n; i++) {
// Printing the stars in the row.
for (int j = 1; j <= n - i; j++) {
System.out.print("*");
}
// Printing the spaces in the row.
for (int j = 0; j < iniS; j++) {
System.out.print(" ");
}
// Printing the stars in the row.
for (int j = 1; j <= n - i; j++) {
System.out.print("*");
}
/* The spaces increase by 2
every time we hit a new row. */
iniS += 2;
// Give a line break for a new row.
System.out.println();
}
// Print the lower half pattern
// Store the initial spaces.
iniS = 2 * n - 2;
for (int i = 1; i <= n; i++) {
// Printing the stars in the row.
for (int j = 1; j <= i; j++) {
System.out.print("*");
}
// Printing the spaces in the row.
for (int j = 0; j < iniS; j++) {
System.out.print(" ");
}
// Printing the stars in the row.
for (int j = 1; j <= i; j++) {
System.out.print("*");
}
/* The spaces decrease by 2
every time we hit a new row. */
iniS -= 2;
// Give a line break for a new row.
System.out.println();
}
}
public static void main(String[] args) {
int N = 5;
// Create an instance of Solution class
Solution sol = new Solution();
sol.pattern19(N);
}
}
class Solution:
# Function to print pattern19
def pattern19(self, n):
# Print the upper half pattern
# Store the initial spaces.
iniS = 0
for i in range(n):
# Printing the stars in the row.
print("*" * (n - i), end="")
# Printing the spaces in the row.
print(" " * iniS, end="")
# Printing the stars in the row.
print("*" * (n - i))
""" The spaces increase by 2
every time we hit a new row."""
iniS += 2
# Print the lower half pattern
# Store the initial spaces.
iniS = 2 * n - 2
for i in range(1, n + 1):
# Printing the stars in the row.
print("*" * i, end="")
# Printing the spaces in the row.
print(" " * iniS, end="")
# Printing the stars in the row.
print("*" * i)
""" The spaces decrease by 2
every time we hit a new row."""
iniS -= 2
if __name__ == "__main__":
N = 5
# Create an instance of Solution class
sol = Solution()
sol.pattern19(N)
class Solution {
// Function to print pattern19
pattern19(n) {
// Print the upper half pattern
// Store the initial spaces.
let iniS = 0;
for (let i = 0; i < n; i++) {
// Printing the stars in the row.
for (let j = 1; j <= n - i; j++) {
process.stdout.write("*");
}
// Printing the spaces in the row.
for (let j = 0; j < iniS; j++) {
process.stdout.write(" ");
}
// Printing the stars in the row.
for (let j = 1; j <= n - i; j++) {
process.stdout.write("*");
}
/* The spaces increase by 2
every time we hit a new row. */
iniS += 2;
// Give a line break for a new row.
console.log();
}
// Print the lower half pattern
// Store the initial spaces.
iniS = 2 * n - 2;
for (let i = 1; i <= n; i++) {
// Printing the stars in the row.
for (let j = 1; j <= i; j++) {
process.stdout.write("*");
}
// Printing the spaces in the row.
for (let j = 0; j < iniS; j++) {
process.stdout.write(" ");
}
// Printing the stars in the row.
for (let j = 1; j <= i; j++) {
process.stdout.write("*");
}
/* The spaces decrease by 2
every time we hit a new row. */
iniS -= 2;
// Give a line break for a new row.
console.log();
}
}
}
let N = 5;
//Create an instance of Solution class
let sol = new Solution();
sol.pattern19(N);