6. Z 字形变换
将一个给定字符串根据给定的行数,以从上往下、从左到右进行 Z 字形排列。
比如输入字符串为 “LEETCODEISHIRING” 行数为 3 时,排列如下:
L C I R
E T O E S I I G
E D H N
之后,你的输出需要从左往右逐行读取,产生出一个新的字符串,比如:“LCIRETOESIIGEDHN”。
请你实现这个将字符串进行指定行数变换的函数:
string convert(string s, int numRows);
示例 1:
输入: s = “LEETCODEISHIRING”, numRows = 3
输出: “LCIRETOESIIGEDHN”
示例 2:
输入: s = “LEETCODEISHIRING”, numRows = 4
输出: “LDREOEIIECIHNTSG”
解释:
L D R
E O E I I
E C I H N
T S G
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/zigzag-conversion
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
#include <string>
#include <vector>
#include <algorithm>
#include <iostream>
using namespace std;
class Solution {
public:
string myStr;
int myNumRows = 0;
Solution(string str,int numRows) : myStr(str),myNumRows(numRows) {};
string convert() {
cout << "myStr: " << myStr << endl;
cout << "myStr: " << myStr.size() << endl;
cout << "myNumRows: " << myNumRows << endl;
if (myNumRows == 1) return myStr;
int n = myStr.size();
n = min(myNumRows, n);
vector<string> rows(n);
int curRow = 0;
bool goingDown = false;
for (int i = 0; i < myStr.size(); ++i) {
rows.at(curRow) += myStr.at(i);
if (curRow == 0 || curRow == myNumRows -1) {
goingDown = !goingDown;
}
curRow += goingDown ? 1 : -1;
} //converted to z
string result;
for (auto &elem: rows) {
cout << "elem: " << elem << " ";
result += elem;
}
cout << endl;
return result;
}
};
int main() {
string str("LEETCODEISHIRING");
cout << "input a string: " << endl;
cin >> str;
int numRows = 3;
cout << "input a int(numRows): " << endl;
cin >> numRows;
Solution sl1(str,numRows);
string result = sl1.convert();
cout << "result: " << result << endl;
}