4.14 leetcode -14 zigzag-conversion

题目描述

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

这个题目，类似于数学题目，肯定不能自己去做个zig操作，就是画图，然后找规律，得到统一表达式

class Solution {
public:
    string convert(string s, int nRows) {
        string rs = s;//长度一致
        int p = 0;
        int diff = (nRows-1)*2;
        int location;
        int nlenth = s.length();
        if(nRows == 1)//1就直接return
            return rs;
        for(int i = 0; i < nRows; i++)
            {
            location = i;
            if(i == 0|| i == (nRows - 1))//最后一行和第一行特例
                {
                if(i == 0)
                    {
                    while(location < nlenth)
                        {
                        rs[p] = s[location];
                        p++;
                        location += diff;
                    }
                    diff -=2;
                }
                else
                    {
                    while(location < nlenth)
                        {
                        rs[p] = s[location];
                        p++;
                        location += (nRows-1)*2;
                    }
                }
            }
            else
                {
                while(location < nlenth)
                        {
                        rs[p] = s[location];
                        p++;
                        location += diff;
                    	if(location < nlenth)//必须的
                            {
                            rs[p] = s[location];
                            p++;
                    		location += 2*i;
                        }
                    	else
                            break;
                    }
                    diff -=2;
            }
        }
        return rs;
    }
};