空心矩形星形图案：
任务是在给定尺寸的空心图案下方打印。
null
********************* ** ** ** *********************
说明：
- 输入行数和列数。
- 对于矩形的行，从1到行运行外部循环。
for (i = 1; i < = rows; i++)
- 对于矩形的列，从1到列运行内部循环。
for (j = 1; j < = columns; j++)
- 第一行或最后一行或第一列或最后一列打印星号，否则打印空白。
- 打印一行的所有列后，在内部循环后打印新行。
C++
// C++ code for hollow rectangle #include <bits/stdc++.h> using namespace std; // Function to print hollow rectangle void print_rectangle( int n, int m) { int i, j; for (i = 1; i <= n; i++) { for (j = 1; j <= m; j++) { if (i == 1 || i == n || j == 1 || j == m) cout << "*" ; else cout << " " ; } cout << endl; } } // Driver Code int main() { int rows = 6, columns = 20; print_rectangle(rows, columns); return 0; } // This code is contributed // by rathbhupendra |
C
// C code for hollow rectangle #include <stdio.h> // Function to print hollow rectangle void print_rectangle( int n, int m) { int i, j; for (i = 1; i <= n; i++) { for (j = 1; j <= m; j++) { if (i==1 || i==n || j==1 || j==m) printf ( "*" ); else printf ( " " ); } printf ( "" ); } } // Driver program for above function int main() { int rows = 6, columns = 20; print_rectangle(rows, columns); return 0; } |
JAVA
// JAVA code for hollow rectangle import java.io.*; class GFG { // Function to print hollow rectangle static void print_rectangle( int n, int m) { int i, j; for (i = 1 ; i <= n; i++) { for (j = 1 ; j <= m; j++) { if (i == 1 || i == n || j == 1 || j == m) System.out.print( "*" ); else System.out.print( " " ); } System.out.println(); } } // Driver program for above function public static void main(String args[]) { int rows = 6 , columns = 20 ; print_rectangle(rows, columns); } } /*This code is contributed by Nikita Tiwari.*/ |
Python3
# Python 3 code for hollow rectangle # Function to print hollow rectangle def print_rectangle(n, m) : for i in range ( 1 , n + 1 ) : for j in range ( 1 , m + 1 ) : if (i = = 1 or i = = n or j = = 1 or j = = m) : print ( "*" , end = "") else : print ( " " , end = "") print () # Driver program for above function rows = 6 columns = 20 print_rectangle(rows, columns) # This code is contributed by Nikita Tiwari. |
PHP
<?php // PHP code for hollow rectangle // Function to print hollow rectangle function print_rectangle( $n , $m ) { $i ; $j ; for ( $i = 1; $i <= $n ; $i ++) { for ( $j = 1; $j <= $m ; $j ++) { if ( $i == 1 || $i == $n || $j == 1 || $j == $m ) echo ( "*" ); else echo ( " " ); } echo ( "" ); } } // Driver Code $rows = 6; $columns = 20; print_rectangle( $rows , $columns ); // This code is contributed by nitin mittal ?> |
Javascript
<script> // JavaScript code for hollow rectangle // Function to print hollow rectangle function print_rectangle(n, m) { var i, j; for (i = 1; i <= n; i++) { for (j = 1; j <= m; j++) { if (i == 1 || i == n || j == 1 || j == m) document.write( "*" ); else document.write( " " ); } document.write( "<br>" ); } } // Driver Code var rows = 6, columns = 20; print_rectangle(rows, columns); // This code is contributed by rdtank. </script> |
输出：
********************* ** ** ** *********************
空心方形星形图案：
********* ** ** ** ** ** *********
说明：
- 输入行数。
- 对于行，从1到N的外部循环。
- 对于列，从1到N的内部循环
- 第一行和最后一行或第一列和最后一列的内部循环打印星形。哪个是印刷明星
if i == 1 or i == N or j == 1 or j == N
- 否则打印空间。
- 打印一行的所有列后，在内部循环后打印一个空行。
C++
// C++ code for hollow squares #include <bits/stdc++.h> using namespace std; // Function to print hollow square void print_square( int n) { int i, j; for (i = 1; i <= n; i++) { for (j = 1; j <= n; j++) { if (i==1 || i==n || j==1 || j==n) cout << "*" ; else cout << " " ; } cout << "" ; } } // Driver code for above function int main() { int rows = 8; print_square(rows); return 0; } // This code is contributed by Code_Mech |
C
// C code for hollow squares #include <stdio.h> // Function to print hollow square void print_square( int n) { int i, j; for (i = 1; i <= n; i++) { for (j = 1; j <= n; j++) { if (i==1 || i==n || j==1 || j==n) printf ( "*" ); else printf ( " " ); } printf ( "" ); } } // Driver code for above function int main() { int rows = 8; print_square(rows); return 0; } |
JAVA
// JAVA code for hollow squares import java.io.*; class GFG { // Function to print hollow square static void print_square( int n) { int i, j; for (i = 1 ; i <= n; i++) { for (j = 1 ; j <= n; j++) { if (i == 1 || i == n || j == 1 || j == n) System.out.print( "*" ); else System.out.print( " " ); } System.out.println(); } } // Driver code for above function public static void main(String args[]) { int rows = 8 ; print_square(rows); } } /*This code is contributed by Nikita Tiwari.*/ |
Python3
# Python 3 code for hollow squares # Function to print hollow square def print_square(n) : for i in range ( 1 , n + 1 ) : for j in range ( 1 , n + 1 ) : if (i = = 1 or i = = n or j = = 1 or j = = n) : print ( "*" , end = "") else : print ( " " , end = "") print () # Driver code for above function rows = 8 print_square(rows) # This code is contributed by Nikita Tiwari. |
<?php// PHP code for hollow squares// Function to prhollow squarefunction print_square($n){ $i; $j; for ($i = 1; $i <= $n; $i++) { for ($j = 1; $j <= $n; $j++) { if ($i == 1 || $i == $n || $j == 1 || $j == $n) print ("*"); else print (" "); } echo ""; }} // Driver Code $rows = 8; print_square($rows); // This code is contributed by Anuj_67?>
C++
// C++ program to print hollow square star // pattern with diagonal #include <bits/stdc++.h> using namespace std; // Function to print hollow square with // primary and secondary diagonal void print_squaredi( int n) { int i, j; for (i = 1; i <= n; i++) { for (j = 1; j <= n; j++) { if (i == 1 || i == n || j == 1 || j == n || i == j || j == (n - i + 1)) cout << "*" ; else cout << " " ; } cout << "" ; } } // Driver code int main() { int rows = 8; print_squaredi(rows); return 0; } // This code is contributed by SHUBHAMSINGH10 |
C
// C program to print hollow square star // pattern with diagonal #include <stdio.h> // Function to print hollow square with // primary and secondary diagonal void print_squaredi( int n) { int i, j; for (i = 1; i <= n; i++) { for (j = 1; j <= n; j++) { if (i==1 || i==n || j==1 || j==n || i==j || j==(n - i + 1)) printf ( "*" ); else printf ( " " ); } printf ( "" ); } } // Driver code for above function int main() { int rows = 8; print_squaredi(rows); return 0; } |
JAVA
// JAVA program to print hollow square // star pattern with diagonal import java.io.*; class GFG { // Function to print hollow square with // primary and secondary diagonal static void print_squaredi( int n) { int i, j; for (i = 1 ; i <= n; i++) { for (j = 1 ; j <= n; j++) { if (i == 1 || i == n || j == 1 || j == n || i == j || j == (n - i + 1 )) System.out.print( "*" ); else System.out.print( " " ); } System.out.println(); } } // Driver code for above function public static void main(String args[]) { int rows = 8 ; print_squaredi(rows); } } /*This code is contributed by Nikita Tiwari.*/ |
Python3
# Python 3 program to print hollow # square star pattern with diagonal # Function to print hollow square with # primary and secondary diagonal def print_squaredi(n) : for i in range ( 1 , n + 1 ) : for j in range ( 1 , n + 1 ) : if (i = = 1 or i = = n or j = = 1 or j = = n or i = = j or j = = (n - i + 1 )) : print ( "*" , end = "") else : print ( " " , end = "") print () # Driver code for above function rows = 8 print_squaredi(rows) # This code is contributed by Nikita Tiwari. |
C#
// C# program to print hollow square // star pattern with diagonal using System; class GFG { // Function to print hollow square with // primary and secondary diagonal static void print_squaredi( int n) { int i, j; for (i = 1; i <= n; i++) { for (j = 1; j <= n; j++) { if (i == 1 || i == n || j == 1 || j == n || i == j || j == (n - i + 1)) Console.Write( "*" ); else Console.Write( " " ); } Console.WriteLine(); } } // Driver code public static void Main() { int rows = 8; print_squaredi(rows); } } // This code is contributed by Nitin Mittal. |
PHP
<?php // PHP program to print hollow square // star pattern with diagonal // Function to print hollow square with // primary and secondary diagonal function print_squaredi( $n ) { $i ; $j ; for ( $i = 1; $i <= $n ; $i ++) { for ( $j = 1; $j <= $n ; $j ++) { if ( $i == 1 or $i == $n or $j == 1 || $j == $n or $i == $j or $j == ( $n - $i + 1)) printf( "*" ); else echo " " ; } echo "" ; } } // Driver Code $rows = 8; print_squaredi( $rows ); // This code is contributed by anuj_67. ?> |
输出：
********** *** * * ** ** ** ** ** * * *** **********
© 版权声明
文章版权归作者所有，未经允许请勿转载。
THE END
![关于”PostgreSQL错误：关系[表]不存在“问题的原因和解决方案-yiteyi-C++库](https://www.yiteyi.com/wp-content/themes/zibll/img/thumbnail.svg)
