g0001_0100.s0006_zigzag_conversion.Solution.cpp Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-all Show documentation

104 LeetCode algorithm problem solutions

There is a newer version: 1.8

// #Medium #String #2024_05_23_Time_3_ms_(97.69%)_Space_10_MB_(97.13%)

#include 
#include 

class Solution {
public:
    std::string convert(std::string s, int numRows) {
        int sLen = s.length();
        if (numRows == 1) {
            return s;
        }
        int maxDist = numRows * 2 - 2;
        std::string buf;
        buf.reserve(sLen);
        for (int i = 0; i < numRows; i++) {
            int index = i;
            if (i == 0 || i == numRows - 1) {
                while (index < sLen) {
                    buf += s[index];
                    index += maxDist;
                }
            } else {
                while (index < sLen) {
                    buf += s[index];
                    index += maxDist - i * 2;
                    if (index >= sLen) {
                        break;
                    }
                    buf += s[index];
                    index += i * 2;
                }
            }
        }
        return buf;
    }
};