#6 ZigZag Conversion

最新推荐文章于 2018-12-04 21:41:03 发布

原创最新推荐文章于 2018-12-04 21:41:03 发布 · 629 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#LeetCode #String #C

LeetCode 专栏收录该内容

28 篇文章

订阅专栏

本文介绍了一种将字符串转换为zigzag模式的方法，并提供了相应的C语言代码实现。zigzag模式是一种在指定行数内将字符串以斜线状排列的方式进行展示。通过此过程，用户可以更好地理解字符串在特定布局下的视觉效果。

原题链接：https://leetcode.com/problems/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 text, int nRows);

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

char* convert(char* s, int numRows) {
    if(numRows == 1)
        return s;
    int len = strlen(s);
    char* ret = (char *)malloc((len + 1) * sizeof(char));
    int i, j, index = 0;
    for(i = 0; i < numRows; ++i) {
        j = i;
        while(j < len) {
            ret[index++] = s[j];
            if(i == 0 || i == numRows - 1)
                j += 2 * numRows - 2;
            else {
                j += 2 * (numRows - i - 1);
                if(j < len) {
                    ret[index++] = s[j];
                    j += 2 * i;
                }
            }
        }
    }
    for(i = 0; i < len; ++i)
        s[i] = ret[i];
    free(ret);
    return s;
}