leetcode算法题--Z字型变换

题目链接：https://leetcode-cn.com/problems/zigzag-conversion/

用一个二维数组来存储这个字符串，就是按照题目的方式存储，然后按行遍历即可。

string convert(string s, int numRows) {
	int length = s.length();
	vector<vector<char>> vec(numRows, vector<char>(length, 0));
	int pos = 0, i = 0, j = 0;
	while (pos!=length){
		for (i; i < numRows; ++i){
			if (pos == length)
				break;
			vec[i][j] = s[pos];
			pos++;
		}
		i = (i - 2 > 0) ? i - 2 : 0;
		j++;
		while (i>0){
			if (pos == length)
				break;
			vec[i][j] = s[pos];
			pos++;
			i--;
			j++;
		}
	}
	string result = "";
	for (int i = 0; i < numRows; ++i){
		for (int j = 0; j < length; ++j){
			if (vec[i][j] != 0){
				result += vec[i][j];
			}
		}
	}
	return result;
}