LEETCODE--ZigZag Conversion-CSDN博客

本文链接：https://blog.csdn.net/prettysky123/article/details/49840063

本文介绍了一种将字符串以Z形排列方式重新组织的方法，并提供了两种实现方案：一种通过计算不同行间的规律进行转换；另一种使用字符串数组进行计算。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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”.

Subscribe to see which companies asked this question
方法一：
发现它们之间的规律，进行计算；不多说了直接看代码

class Solution {
public:
    string convert(string s, int numRows) {
        if(numRows == 1)
            return s;
        int len = s.size();
        string New;
        int interval = 2*(numRows-1);
        int strItv = interval;
        int number = 0;
        for(int i = 0; i < numRows; i++){
            string substitude;
            number = i;
            int itv = strItv;
            while(1){
                if(number > len-1)
                    break;
                else{
                   if(itv > 0){
                        char a = s[number];
                        substitude += a;
                        number += itv;
                    }
                    itv = interval - itv;
                }
            }
            strItv -= 2;
            New += substitude;
        }
        return New;
    }
};

方法二：
利用string A[];字符串数组进行计算；

class Solution {
public:
    string convert(string s, int nRows){
        if(nRows == 1) return s;
        string substitude[nRows];
        int i = 0, j, gap = nRows-2;
        while(i < s.size()){
            for(j = 0; i < s.size()&&j < nRows; ++j)
                substitude[j] += s[i++];
            for(j = gap; i < s.size()&&j > 0; --j)
                substitude[j] += s[i++];
        }
        string str = "";
        for(i = 0; i < nRows; ++i)
            str += substitude[i];
        return str;
    } 
};