LeetCode 6. ZigZag Conversion ( C ) - Medium

同步发于 JuzerTech 网站，里面有我软、硬件学习的纪录与科技产品开箱，欢迎进去观看。

题目为给定一个字符串，把该字符串照 zigzag pattern (锯齿型) 排列，如下图所示依照红色箭头依序排列，此图假设 Row 为 4，并依照排序后的每一行 ( Row ) 字符输出，可以参考下方题目原文的范例。

题目与范例如下

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

Example 3:

Input: s = "A", numRows = 1
Output: "A"

 

Constraints:

• 1 <= s.length <= 1000
• s consists of English letters (lower-case and upper-case), ',' and '.'.
• 1 <= numRows <= 1000

 

我的解题策略为，依照行( Row ) 一行一行输出，透过Step 做跳跃， Step 的大小为( numRows - 1 ) x 2 ，并于第二行之后采用先输出减row 的值，在输出加row的值，并于最后一行( Row ) 时，保护不重复输出。

 

下方为我的代码

char * convert(char * s, int numRows){
    if(strlen(s) == 1 || numRows == 1)
        return s;
    int step = (numRows-1)*2, rIndex = 0,strl = strlen(s);
    char *r = (char *)malloc((strl+1)*sizeof(char));
    r[strl] = '\0';
    for(int i = 0;i<numRows;i++){
        int jump = 0;
        while(jump<strl){
            if(jump+i<strl && i!=(numRows-1)){
                r[rIndex] = s[jump+i];
                rIndex++;
            }
            jump+=step;
            if(jump-i<strl && i!=0){
                r[rIndex] = s[jump-i];
                rIndex++;
            }
        }
    }
    
    return r;
}

下方为时间与空间之消耗

Runtime: 0 ms, faster than 100.00 % of C online submissions for ZigZag Conversion.

Memory Usage: 6.5 MB, less than 86.07 % of C online submissions for ZigZag Conversion.