LeetCode 6: ZigZag Conversion
2013-08-28 15:53
176 查看
Difficulty: 3
Frequency: 1
Problem:
The string
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)
And then read line by line:
Write the code that will take a string and make this conversion given a number of rows:
Solution:
class Solution {
public:
string convert(string s, int nRows) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
if (nRows<=1) //Without this condition will cause Memory Limit Exceeded.
return s;
string answer;
if (s.size()==0)
return answer;
int k, index;
for (int i = 0; i<nRows; i++)
{
for (k = 0, index = i; index<s.size(); k++, index = (2*nRows - 2)*k+i)
{
answer += s[index];
if (i==0||i==nRows-1)
continue;
if ((index += 2*(nRows-i-1))<s.size())
{
answer += s[index];
}
}
}
return answer;
}
};
Notes:
If without condition judgement nRows<=1, Memory Limits Exceeded will occur.nRows<=1
Frequency: 1
Problem:
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".
Solution:
class Solution {
public:
string convert(string s, int nRows) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
if (nRows<=1) //Without this condition will cause Memory Limit Exceeded.
return s;
string answer;
if (s.size()==0)
return answer;
int k, index;
for (int i = 0; i<nRows; i++)
{
for (k = 0, index = i; index<s.size(); k++, index = (2*nRows - 2)*k+i)
{
answer += s[index];
if (i==0||i==nRows-1)
continue;
if ((index += 2*(nRows-i-1))<s.size())
{
answer += s[index];
}
}
}
return answer;
}
};
Notes:
If without condition judgement nRows<=1, Memory Limits Exceeded will occur.nRows<=1
相关文章推荐
- LeetCode_ZigZag Conversion_006
- LeetCode OJ ZigZag Conversion
- LeetCode - ZigZag Conversion
- LeetCode-6-ZigZag-Conversion 找规律水题
- LeetCode-6(ZigZag Conversion)
- leetcode 6. ZigZag Conversion golang实现
- LeetCode6—ZigZag Conversion
- Leetcode 6. ZigZag Conversion The Solution of Python
- leetcode之ZigZag Conversion
- Leetcode ZigZag conversion
- LeetCode ZigZag Conversion
- Leetcode ZigZag Conversion
- leetcode ZigZag Conversion
- leetcode题解||ZigZag Conversion问题
- LeetCode 6 ZigZag Conversion(Z型转换)
- LeetCode 6 ZigZag Conversion (C,C++,Java,Python)
- [Leetcode]6. ZigZag Conversion @python
- [leetcode] 6. ZigZag Conversion
- [leetcode] ZigZag Conversion *
- leetcode 006 ZigZag Conversion