leetcode ZigZag Conversion

zigzag字符串转换算法实现

最新推荐文章于 2021-11-05 22:58:08 发布

原创最新推荐文章于 2021-11-05 22:58:08 发布 · 386 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode #c++

leetcode 专栏收录该内容

16 篇文章

订阅专栏

本文介绍了一种将字符串按照指定行数以Z形模式排列并读取的方法，并提供了相应的C++代码实现。

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 text, int nRows);

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

class Solution {
public:
    string convert(string s, int numRows) {
        vector<string> v(numRows);
        string str;
        int n = 0;
        bool flag = true;
        int len = s.size();
        if (numRows == 1) return s;
        for (int i =0;i!=len;++i)
        {
            v[n].push_back(s[i]);
            if (i % (numRows-1) == 0){
                flag = !flag;
            }
            
            if (flag) {
                    n -=1;
            }else{
                    n +=1;
            }
        }
        
        for (vector<string>::iterator iter = v.begin();
                iter != v.end();++iter)
        {
            str+= *iter;
        }
        
        return str;
    }
};