ZigZag Conversion
来源:互联网 发布:淘宝上传宝贝图片教程 编辑:程序博客网 时间:2024/04/27 13:15
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”.
思路:建立numRows个数组分别记录每一行的字符串,遍历一遍字符串,将每个字符放在对应的数组中,遍历的顺序是先向下,在对角线,之后以此重复,最后将每一行的代码拼接起来即可,代码如下:
class Solution {public: string convert(string s, int numRows) { if(numRows==1) return s; int len = s.length(),i = 0,j; string *res = new string[numRows]; while(i < len){ for(j = 0; j < numRows && i < len; ++j) res[j] += s[i++]; for(j = numRows - 2; j > 0 && i < len; j--) res[j] += s[i++]; } string ret = ""; for(i = 0; i < numRows; ++i) ret +=res[i]; return ret; }};
0 0
- ZigZag Conversion
- ZigZag Conversion
- ZigZag Conversion
- Zigzag Conversion
- ZigZag Conversion
- ZigZag Conversion
- ZigZag Conversion
- ZigZag Conversion
- ZigZag Conversion
- ZigZag Conversion
- ZigZag Conversion
- ZigZag Conversion
- ZigZag Conversion
- ZigZag Conversion
- ZigZag Conversion
- ZigZag Conversion
- ZigZag Conversion
- ZigZag Conversion
- lightOJ 1317 - Throwing Balls into the Baskets
- hdu 1514 树状数组模板题
- Andrew Stankevich Contest 35 简要题解
- poj 3417 Network 【LCA】【树中增新边后 求每条树边被环所覆盖的次数】
- hdu 5389 Zero Escape (DP+类似01背包)
- ZigZag Conversion
- Spring学习笔记-springMVC入门Demo
- 关于NSArray使用时用strong修饰还是copy修饰问题测试
- HDU149850 years, 50 colors(行列匹配+最小点覆盖)
- java基础_正则表达式
- java 排错的技巧
- 我们为什么需要版本控制系统?
- HDU 2137 circumgyrate the string
- linux mkdir创建多层目录