my raw answers for leetcode - 6. 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)

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:

 

Solution1:

class Solution {
public:
    string convert(string s, int numRows) {
        if(1==numRows) return s;
        if(s.size()<=numRows) return s;
        vector<string> rows(min(int(s.size()), numRows));
        bool goingdown = false;
        int now_row = 0;
        for(char &c:s)//store string in zigzag
        {
            rows[now_row] += c;
            if(now_row==0||now_row==numRows-1) goingdown = !goingdown;//when now_row meet the first or last row,

                                                                                                                      //change direction(goingdown true or false)
            now_row += goingdown?1:-1;//if goingdown, the next row is lower, otherwise upper
        }
        
        string res = "";
        for(int i = 0; i < numRows; i ++){   //read string row by row
            res += rows[i];
        }
        return res;
    }
};

comment:

28 ms

12.6 MB

Cpp

 

My annotations are easily understood.

 

 

Solution2:

class Solution {
public:
    string convert(string s, int numRows) {
        if (1==numRows) return s;
        if (s.size()<=numRows) return s;
        int step = 2 * numRows - 2;
        string res = "";
        for(int i = 0; i < numRows; i ++)
        {
            int index = i;
            int add = 2 * i;
            while(index<s.length()){
                res += s[index];
                add = step - add;
                index += (i==0||i==numRows-1)?step:add;
            }
        }
        return res;
    }
};

12 ms

10.1 MB

Cpp

 

comment: