6.字符串的反N型曲折转换

找出规律即可

#include <iostream>
#include <string>
using namespace std;
class Solution {
public:
	string convert(string s, int nRows) {
		if (nRows <= 1) return s;
		string result;
		for (int i = 0; i < nRows; ++i)
		{
			int j = i;
			while (j < s.size())
			{
				result.push_back(s[j]);
				if (i != 0 && i != nRows - 1 && j + 2 * (nRows - 1 - i) < s.size())
					result.push_back(s[j + 2 * (nRows - 1 - i)]);				
				j += 2 * (nRows - 1);
			}
		}
		return result;
	}
};

int main()
{
	string s;
	int nRows;
	Solution so;
	while (cin >> s >> nRows) cout << so.convert(s, nRows) << endl;
	return 0;
}