Leetcode_6 ZigZag Conversion

本文介绍了一种将字符串以Z字形方式分布在指定数量的行上的算法实现,并提供了详细的代码示例。通过调整行数,可以改变输出字符串的布局。

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

Example 1:

Input: s = “PAYPALISHIRING”, numRows = 3
Output: “PAHNAPLSIIGYIR”

Example 2:

Input: s = “PAYPALISHIRING”, numRows = 4
Output: “PINALSIGYAHRPI”
Explanation:

P I N
A L S I G
Y A H R
P I

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

Example 1:

Input: s = “PAYPALISHIRING”, numRows = 3
Output: “PAHNAPLSIIGYIR”

Example 2:

Input: s = “PAYPALISHIRING”, numRows = 4
Output: “PINALSIGYAHRPI”
Explanation:

P I N
A L S I G
Y A H R
P I

题目大致意思:就是将一个字符串竖着以Z字型排列。
思路:其实可以用一个二维vector模拟,不过是竖着模拟。注意行越界的情况,还有当字符串是空的情况。

代码:

class Solution {
public:
    string convert(string s, int numRows)
    {
        int len = s.length();
        if(numRows==1)  return s;
        if(len==0)  return "0";
        vector<vector<char> > vec;
        vec.resize(numRows);//r行
        for (int k = 0; k < numRows; ++k) {
            vec[k].resize(len);

        }
        for(int i=0;i<numRows;i++)
            for(int j=0;j<vec[0].size();j++)  vec[i][j] = '#';
        cout<<vec[0].size()<<endl;
        int row=0,col=0,cnt=0;
        while(len)
        {
            if(col%(numRows-1)==0)
            {
                vec[row][col] = s[cnt];
                row++;
            }
            else
            {
                vec[row][col] = s[cnt];
                row--;
                col++;
            }
            if(row==numRows)
            {
                row-=2;
                col++;
            }
            --len;
            ++cnt;
        }
        cout<<col<<endl;
        string ans;
        for(int i=0;i<numRows;i++)
            for(int j=0;j<=col;j++)
            {
                if(vec[i][j]!='#')  ans.push_back(vec[i][j]);
            }
        return ans;
    }
};
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值