【LeetCode算法练习(C++)】 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”.

链接:ZigZag Conversion
解法:遍历重排,时间O(n)

class Solution {
public:
    string convert(string s, int numRows) {
        string ans;
        vector<string> vs;
        for (int i = 0; i < numRows; i++) {
            string sub;
            vs.push_back(sub);
        }
        int len = s.length(), cnt = 0;
        bool up = false;
        for (int i = 0; i < len; i++) {
            vs[cnt] += s[i];
            if (cnt == 0) up = false;
            else if (cnt == numRows - 1) up = true;
            if (numRows == 1) ;
            else if (up) cnt--;
            else cnt++;
        }
        for (int i = 0; i < numRows; i++) {
            ans += vs[i];
        }
        return ans;
    }
};

Runtime: 25 ms

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值