LeetCode算法系列：6. ZigZag Conversion

目录

题目描述：

算法实现：

题目描述：

---

The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility)

P   A   H   N
A P L S I I G
Y   I   R

And then read line by line: "PAHNAPLSIIGYIR"

Write the code that will take a string and make this conversion given a number of rows:

string convert(string s, int numRows);

Example 1:

Input: s = "PAYPALISHIRING", numRows = 3
Output: "PAHNAPLSIIGYIR"

Example 2:

Input: s = "PAYPALISHIRING", numRows = 4
Output: "PINALSIGYAHRPI"
Explanation:

P     I    N
A   L S  I G
Y A   H R
P     I

算法实现：

这个题目比较简单，有很明显得周期性，但是要注意各个模块得起始和终止点，以及特殊情况：比如numRows为1的特殊情况等

class Solution {
public:
    string convert(string s, int numRows) {
        if(numRows == 1)return s;
        else
        {
            string p = "";
            for(int i = 0; i < numRows; i ++)
            {
                int j = i;
                if((i != 0) && (i != (numRows - 1)))
                    while(j < s.size())
                    {
                        p += s[j];
                        if(2*numRows - 2 - i - i + j < s.size())p += s[2*numRows - 2 - i - i + j];
                        j += 2 * (numRows - 1);
                    }
                else
                {                
                    while(j < s.size())
                    {
                        p += s[j];
                        j += 2 * (numRows - 1);
                    }
                }
            }
            return p;
            }

    }
};