• 6. ZigZag Conversion(C++)


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

    答案:

    class Solution {
    public:
      string convert(string s, int numRows) {
        if(numRows==1)
          return s;
        string str;
        int loop = 1 + s.size()/(2*numRows-2);
        for(int j=0;j<numRows;j++){
          for(int t=0;t<loop;t++){
            int tmp = j+2*(numRows-1)*t;
            if(j==0 || j==(numRows-1)){
              if(tmp<s.size()){
                str+=s[tmp];
              }
            }else{
              int tmp1 = tmp+2*(numRows-1-j);
              if(tmp<s.size()){
                str+=s[tmp];
              }
              if(tmp1<s.size()){
                str+=s[tmp1];
              }
            }
          }
        }
        return str;
      }
    };

    更好的方法:

    class Solution {
    public:
      string convert(string s, int numRows) {
        if (numRows <= 1)
          return s;

        const int len = (int)s.length();
        string *str = new string[numRows];

        int row = 0, step = 1;
        for (int i = 0; i < len; ++i)
        {
          str[row].push_back(s[i]);

          if (row == 0)
            step = 1;
          else if (row == numRows - 1)
            step = -1;

          row += step;
        }

        s.clear();
        for (int j = 0; j < numRows; ++j)
        {
          s.append(str[j]);
        }

        delete[] str;
        return s;
       }
    };

  • 相关阅读:
    PAT 00-自测1. 打印沙漏(20)
    js Ajax
    c语言算法实现
    解决python for vs在vs中无法使用中文
    python排序算法实现:
    2014-4-27 心情
    Sdut 2416 Fruit Ninja II(山东省第三届ACM省赛 J 题)(解析几何)
    Poj 1061 青蛙的约会(扩展欧几里得)
    hrbust 1328 相等的最小公倍数(数论)
    hdu 1286 找新朋友 (欧拉函数)
  • 原文地址:https://www.cnblogs.com/devin-guwz/p/6480266.html
Copyright © 2020-2023  润新知