我最近在一次采访中遇到了这个问题,我不得不打印一个图案。模式看似微不足道,但我不知道解决方案。请帮助我用我的代码识别错误。
下面是测试用例:
n = 1
x
n = 2
x
x x
x
n = 3
x
x
x o x
x
x
n = 5
x
x
o x
o x
x o x o x
x o
x o
x
x
n = 10
x
x
o x
o x
x o x
x o x
o x o x
o x o x
x o x o x
x o x o x x o x o x
x o x o x
x o x o
x o x o
x o x
x o x
x o
x o
x
x
这是我的尝试:
#include <iostream>
using namespace std;
string reverse(string s) {
int start = 0, end = s.size()-1;
while(start<end) {
char temp = s[start];
s[start] = s[end];
s[end] = temp;
++start;
--end;
}
return s;
}
int main() {
int n;
cin>>n;
int count=0;
string s = "X";
bool wasLastX = true;
for (int i=1;i<=n-1;++i) {
for(int j=1;j<=n-1;++j) {
cout<<" ";
}
cout<<s<<endl;
if (i == n-1) {
break;
}
if (s[0] == 'X' || s[0] == 'O') {
s.insert(s.begin(), ' ');
}
else {
if (wasLastX) {
s.insert(s.begin(), 'O');
wasLastX = false;
}
else {
s.insert(s.begin(), 'X');
wasLastX = true;
}
}
++count;
}
string temp = s;
if (n%2 == 0) {
cout<<s<<" "<<s<<endl;
}
else {
if (s[1] == 'X') {
s.insert(s.begin(), 'O');
}
else if (s[1] == 'O') {
s.insert(s.begin(), 'X');
}
cout<<reverse(temp)<<s<<endl;
}
int count1 = 0;
for (int i=1;i<=n-1;++i) {
cout<<" ";
for(int j=1;j<=count1;++j) {
cout<<" ";
}
cout<<temp<<endl;
temp.pop_back();
++count1;
}
return 0;
}
首先,我打印上半部分,然后从生成的上半部分开始打印,对于下半部分,我将其反转并再次打印。
这是我的输出:
n = 1
xx
n = 3
X
X
X O X
X
n = 5
X
X
O X
O X
X O X O X
O X
O
O
但是,代码对于n = 2和n = 10正常工作。但是,对于n = 4,它仍然显示错误的输出。因此,我不能一概而论,认为它不适用于n的奇数个值。 对于n = 4,这是错误的,因为中间行之后的所有元素都应以x开头,而我的元素应以o开头。
X
X
O X
O X O X
O X
O
O
答案 0 :(得分:2)
对不起,我无法遵循您为解决问题而开发的复杂逻辑。这是一个很简单的代码,可以解决您的问题。
#include <string>
#include <iostream>
#include <cstdlib>
using namespace std;
/* its important the next string is symmetrical */
string s1 = "x o x";
string s2 = " ";
int main()
{
int n, i, l = s1.size();
cin >> n;
while (n > l) {
s1 += s1.substr(1, l-1);
s2 += s2.substr(1, l-1);
l = 2*l - 1;
}
for (i = 1; i < n; ++i) {
cout << s2.substr(0, n-1)
<< s1.substr(l - i, l)
<< endl;
}
cout << s1.substr(0, n - 1)
<< s1.substr(l - n, n)
<< endl;
for (i = 1; i < n; ++i) {
cout << s2.substr(0, i)
<< s1.substr(0, n - i)
<< endl;
}
}
答案 1 :(得分:1)
由于最初在这个问题上附加了一个[java]
标签,因此我尝试使用Java代码实现它。希望对构建C代码逻辑有帮助
public class ThunderBoltPattern {
public static void main(String[] args) {
int input = 5;
int evenOddFactor = (input % 2 == 0) ? 0 : 1; // If it is even, add 1 else it should be 0
// length on pattern based on input
int length = input * 2 - evenOddFactor;
// Using character array to store individual character at various point
char[][] array = new char[length][length];
int factor = 0;
while (factor < input) {
for (int i = 0 + factor, j = input - 1; i < input; i++, j++) {
array[i][j] = 'x';
array[j][i] = 'x';
}
for (int i = 2 + factor, j = input - 1; i < input; i++, j++) {
array[i][j] = 'o';
array[j][i] = 'o';
}
// Because character are repeated on same line after 4 digit, using 4 as factor
factor += 4;
}
for (char[] chs : array) {
for (char ch : chs) {
System.out.print(ch);
}
System.out.println();
}
}
}