给定n的值，即正方形中的行数/列数，请打印图案。
例子 ：
Input : n = 8
Output :
0 0 0 0 0 0 0 0
0 1 1 1 1 1 1 0
0 1 1 1 1 1 1 0
0 1 1 1 1 1 1 0
0 1 1 1 1 1 1 0
0 1 1 1 1 1 1 0
0 1 1 1 1 1 1 0
0 0 0 0 0 0 0 0
Input : n = 10
Output :
0 0 0 0 0 0 0 0 0 0
0 1 1 1 1 1 1 1 1 0
0 1 1 1 1 1 1 1 1 0
0 1 1 1 1 1 1 1 1 0
0 1 1 1 1 1 1 1 1 0
0 1 1 1 1 1 1 1 1 0
0 1 1 1 1 1 1 1 1 0
0 1 1 1 1 1 1 1 1 0
0 1 1 1 1 1 1 1 1 0
0 0 0 0 0 0 0 0 0 0
C++
// C++ implementation of ones
// inside zeroes pattern
#include
using namespace std;
// function to print the pattern
void print_pattern(int n)
{
int k = 1, m = n;
int zero = 0, one = 1;
// for loop to keep track of
// number of rows
for (int i = 1; i <= n; i++) {
// for loop to keep track of
// number of columns
for (int j = 1; j <= n; j++) {
// if first row or last row
if (i == k || i == m)
cout << " " << zero;
// if first column or last column
else if (j == k || j == m)
cout << " " << zero;
// to print 1 in remaining portion
else
cout << " " << one;
}
cout << endl;
}
}
// driver code
int main()
{
// get value of n from user
int n = 8;
// function calling
print_pattern(n);
return 0;
} Java
// Java implementation of ones
// inside zeroes pattern
class GFG
{
// function to print the pattern
static void print_pattern(int n)
{
int k = 1, m = n;
int zero = 0, one = 1;
// for loop to keep track of
// number of rows
for (int i = 1; i <= n; i++) {
// for loop to keep track of
// number of columns
for (int j = 1; j <= n; j++) {
// if first row or last row
if (i == k || i == m)
System.out.print(" "+zero);
// if first column or last column
else if (j == k || j == m)
System.out.print(" "+zero);
// to print 1 in remaining portion
else
System.out.print(" "+one);
}
System.out.print("\n");
}
}
// Driver code
public static void main(String args[])
{
// get value of n from user
int n = 8;
// function calling
print_pattern(n);
}
}
//This code is written by Azkia Anam.Python3
# Python 3 implementation of ones
# inside zeroes pattern
# function to print the pattern
def print_pattern(n):
k = 1
m = n
zero = 0
one = 1
# for loop to keep track of
# number of rows
for i in range(1, n+1):
# for loop to keep track of
# number of columns
for j in range(1,n+1):
# if first row or last row
if (i == k or i == m):
print(" ",end="0")
# if first column or last column
elif (j == k or j == m):
print(" ",end="0")
# to print 1 in remaining portion
else:
print(" ",end="1")
print("\r")
# driver code
# get value of n from user
n = 8
# function calling
print_pattern(n)
# This code is written
# by Azkia Anam.C#
// C# implementation of ones
// inside zeroes pattern
using System;
class GFG
{
// function to print the pattern
static void print_pattern(int n)
{
int k = 1, m = n;
int zero = 0, one = 1;
// for loop to keep track of
// number of rows
for (int i = 1; i <= n; i++) {
// for loop to keep track of
// number of columns
for (int j = 1; j <= n; j++) {
// if first row or last row
if (i == k || i == m)
Console.Write(" "+zero);
// if first column or last column
else if (j == k || j == m)
Console.Write(" "+zero);
// to print 1 in remaining portion
else
Console.Write(" "+one);
}
Console.WriteLine();
}
}
// driver code
public static void Main()
{
// get value of n from user
int n = 8;
// function calling
print_pattern(n);
}
}
//This code is written by vt_m.PHP
输出 ：
0 0 0 0 0 0 0 0
0 1 1 1 1 1 1 0
0 1 1 1 1 1 1 0
0 1 1 1 1 1 1 0
0 1 1 1 1 1 1 0
0 1 1 1 1 1 1 0
0 1 1 1 1 1 1 0
0 0 0 0 0 0 0 0
想要从精选的最佳视频中学习并解决问题，请查看有关从基础到高级C++的C++基础课程以及有关语言和STL的C++ STL课程。要完成从学习语言到DS Algo等的更多准备工作，请参阅“完整面试准备课程” 。