Leetcode刷题-ZigZag

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);

官方的解决方案

在这里插入图片描述

class Solution {
public:
    string convert(string s, int numRows) {

        if (numRows == 1) return s;

        string ret;
        int n = s.size();
        int cycleLen = 2 * numRows - 2;

        for (int i = 0; i < numRows; i++) {
            for (int j = 0; j + i < n; j += cycleLen) {
                ret += s[j + i];
                if (i != 0 && i != numRows - 1 && j + cycleLen - i < n)
                    ret += s[j + cycleLen - i];
            }
        }
        return ret;
    }
};
// 我的解决方案
// Runtime: 56 ms, faster than 27.27% of C++ online submissions for ZigZag Conversion.
// Memory Usage: 14.1 MB, less than 18.64% of C++ online submissions for ZigZag Conversion.
class Solution {
public:
    string convert(string s, int numRows) {
        if(s.length() == 0 or numRows <= 1)
            return s;
        int row = numRows;
        int col = numRows-1;
        int flag[row][col];
        memset( flag, 0, sizeof(flag));
        for(int i = 0;i < row;i++){
            flag[i][0] = 1;
        }
        for(int i = 1; i < col;i++){
            int j = row-i-1;
            flag[j][i] = 1;
        }
  
        vector<string> vstr(numRows,"");
        int cur = 0;
        int m = 0;
        int n = 0;
        int loop = row*col;
        int loopCnt = 0;
        while(cur < s.length()){
            if(flag[m][n] == 1){
                vstr[m] += s[cur++];
            }
            m++;
            if(m >= row){
                m = 0;
                n++;
            }
            loopCnt++;
            if(loopCnt >= loop){
                m = 0;
                n = 0;
                loopCnt = 0;
            }
        }

        string rs = "";
        for(int i = 0;i < numRows;i++){
            rs += vstr[i];
        }
  
        return rs;
    }
};
// 总结:我的思路还是不清晰,方法也不够高级,做题太少了的缘故吧
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值