.ZigZag Conversion题目分析

题目

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

Subscribe to see which companies asked this question.

解析：

1.先知道ZigZag的用法：字符串数组 string[rows] 用来存储每一行，拼接得到最终结果，用一个delta表示正向还是反向

2.弄清题目，按照"Z"形重新排列字符串，再按行链接起来输出。通过几个例子发现规律：

 2排的时候，1到n的排序

1 3 5 7 9 ...
2 4 6 8 10...

 3排的时候，1到n的排序
1 5 9...
2 4 6 8 10 ...
3 7 11 ...

 4排的时候，1到n的排序
1 7 13 ...
2 6 8 12 14 ...
3 5 9 11 15 ...
4 10 16 ...
再多写几组不难发现规律，这里我们假设我们分成m排：
1 第i排从i开始
2 第i排两个数的间隔是2(i-1),2(m-i)交替

代码：

int lengthOfLongestSubstring(string s) {

 int hash_char[256];

memset(hash_char, -1, sizeof(hash_char));

 int curr = -1, max = 0; 

 for (int i = 0; i < s.size(); i++) {

if (hash_char[s[i]] > curr)

 curr = hash_char[s[i]];

max = max > i - curr ? max : i - curr;  

 hash_char[s[i]] = i;

 }

return max;

 }