Leetcode: 6. ZigZag Conversion

Description

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)

Example

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".

思路

  • 这个题好像也没有什么简便方法,找规律吧

代码

  • 时间复杂度:O(n)
class Solution {
public:
   string convert(string s, int numRows) {
        int len = s.size();
        if (numRows <= 1 || len <= 1)  return s;

        string res(s);

        int countX = 2 * numRows - 2;
        int countY = 0;
        int index = 0;

        int tmp = numRows;
        int k = 0;
        while (tmp > 0){

            if (countY == 0){
                int i = index;
                countX = numRows * 2 - 2;
                while (i < len){
                    res[k++] = s[i];
                    i = i + countX;
                }
                index++;
                countX -= 2;
                countY += 2;
            }
            else if (countX != 0 && countY != 0){
                int i = index;
                while (i < len){
                    res[k++] = s[i];
                    i = i + countX;
                    if (i < len){
                        res[k++] = s[i];
                        i = i + countY;
                    }
                }
                index++;
                countX -= 2;
                countY += 2;
            }
            else if (countX == 0){
                int i = index;
                countX = numRows * 2 - 2;
                while (i < len){
                    res[k++] = s[i];
                    i = i + countX;
                }
                index++;
                countX -= 2;
                countY += 2;
            }
            tmp--;
        }

        return res;
    }
};

转载于:https://www.cnblogs.com/lengender-12/p/6809892.html

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值