6、Z字形变换

  1. 示例 1:
  2. 示例 2:
  3. C++代码,坐标变换
  4. java代码,字符寻址
  5. C++版

将一个给定字符串根据给定的行数,以从上往下、从左到右进行 Z 字形排列。

比如输入字符串为 “LEETCODEISHIRING” 行数为 3 时,排列如下:

L   C   I   R
E T O E S I I G
E   D   H   N

之后,你的输出需要从左往右逐行读取,产生出一个新的字符串,比如:”LCIRETOESIIGEDHN”。

请你实现这个将字符串进行指定行数变换的函数:

string convert(string s, int numRows);

示例 1:

输入: s = “LEETCODEISHIRING”, numRows = 3
输出: “LCIRETOESIIGEDHN”

示例 2:

输入: s = “LEETCODEISHIRING”, numRows = 4
输出: “LDREOEIIECIHNTSG”
解释:

L     D     R
E   O E   I I
E C   I H   N
T     S     G

C++代码,坐标变换

class Solution {
public:
    // 找规律即可
    string convert(string s, int numRows) {
        // 特殊情况处理
        if (s == "") { return "";}
        if (numRows == 1) return s;
        int len = s.length();
        string res = "";
        int x = 2*numRows-2;// 每一个但愿如此有x个字母
        int m = len/x;
        if (len%x != 0) m++;
        for (int i = 0;i < numRows;i++) {
            for (int j = i;j < len;j+=x) {
                if (i == 0 || i == numRows - 1) {
                    res += s[j];
                } else {
                    res += s[j];
                    if ((j + x - 2*i) < len) { // 防止越界
                        res += s[j+x-2*i];
                    }
                    
                }
            }
        }
        
        return res;
        
    }
};

java代码,字符寻址

class Solution {
    public String convert(String s, int numRows) {
        // 特殊情况处理
        if (numRows == 1) return s;
        // 结果集初始化
        List<StringBuilder> rows = new ArrayList<>();
        for (int i = 0;i < Math.min(numRows,s.length()); i++) {
            rows.add(new StringBuilder());
        }
        
        int curRow = 0;// 寻址变量
        boolean goingDown = false;// 控制变量
        
        for (char c : s.toCharArray()){
            rows.get(curRow).append(c);
            // 变向 0 2...numRows-1 numRows-2 ..0 1 2
            if (curRow == 0 || curRow == numRows - 1) {
                goingDown = !goingDown;
            }
            curRow += goingDown ? 1:-1;
        }
        
        StringBuilder ret = new StringBuilder();
        for (StringBuilder row : rows) ret.append(row);
        return ret.toString();
    }
}

C++版

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

        if (numRows == 1) return s;

        vector<string> rows(min(numRows, int(s.size())));
        int curRow = 0;
        bool goingDown = false;

        for (char c : s) {
            rows[curRow] += c;
            if (curRow == 0 || curRow == numRows - 1) goingDown = !goingDown;
            curRow += goingDown ? 1 : -1;
        }

        string ret;
        for (string row : rows) ret += row;
        return ret;
    }
};

转载请注明来源,欢迎对文章中的引用来源进行考证,欢迎指出任何有错误或不够清晰的表达。可以在下面评论区评论,也可以邮件至 1056615746@qq.com

💰

Title:6、Z字形变换

Count:501

Author:攀登

Created At:2020-07-26, 00:19:44

Updated At:2024-06-15, 15:52:32

Url:http://jiafeimao-gjf.github.io/2020/07/26/6%E3%80%81Z%E5%AD%97%E5%BD%A2%E5%8F%98%E6%8D%A2/

Copyright: 'Attribution-non-commercial-shared in the same way 4.0' Reprint please keep the original link and author.

×

Help us with donation