LeetCode---ZigZag Conversion

标签：string   leetcode   算法   zigzag   

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

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

string convert(string text, int nRows);

convert("PAYPALISHIRING", 3) should return "PAHNAPLSIIGYIR".

解决方法：将原字符串先向下后向上依次填入字符串数组，然后将所有的字符串相加即可得到输出。

class Solution 
{
public:
    string convert(string s, int nRows) 
    {
        if(nRows == 1)
            return s;
        string temp[nRows];
        for(int i=0; i<nRows; i++)
            temp[i] = "";
        bool down = true;
        int j=0;
        for(int i=0; i<s.length(); i++)
        {
            temp[j] = temp[j] + s[i];
            if(j == nRows-1)
                down = false;
            else if(j == 0)
                down = true;
            if(down)
                j++;
            else
                j--;
        }
        string res="";
        for(int i=0; i<nRows; i++)
            res +=temp[i];
        return res;
    }
};

LeetCode---ZigZag Conversion

标签：string   leetcode   算法   zigzag   

原文地址：http://blog.csdn.net/shaya118/article/details/42506371