#6. ZigZag Conversion
来源:互联网 发布:知乎b站三国演义 编辑:程序博客网 时间:2024/06/02 18:21
1. 题目
ZigZag字符串的描述见题目链接。给定行号,对于一个ZigZag字符串,需要按行号顺序输出每行的内容。
2. 代码
# 比较简单,将ZigZag字符串按顺序遍历,每个字符放入对应行中class Solution(object): def convert(self, s, numRows): """ :type s: str :type numRows: int :rtype: str """ if numRows == 1: return s ret = [[] for i in range(numRows)] cur = 0 loop = 0 while cur < len(s): if loop < numRows: ret[loop].append(s[cur]) else: ret[numRows * 2 - 2 - loop].append(s[cur]) cur += 1 loop += 1 loop %= (numRows * 2 - 2) ans = '' for item in ret: ans += ''.join(item) return ans
0 0
- LeetCode 6. ZigZag Conversion
- LeetCode --- 6. ZigZag Conversion
- LeetCode 6.ZigZag Conversion
- [Leetcode] 6. ZigZag Conversion
- 6.ZigZag Conversion
- 6. ZigZag Conversion
- 6. ZigZag Conversion
- 【leetcode】6. ZigZag Conversion
- 6.ZigZag Conversion
- 6. ZigZag Conversion
- 6.ZigZag Conversion
- [LeetCode] 6.ZigZag Conversion
- LeetCode - 6. ZigZag Conversion
- 6. ZigZag Conversion
- 6. ZigZag Conversion
- 6.ZigZag Conversion(93.10%)
- 6. ZigZag Conversion
- [leetcode] 6. ZigZag Conversion
- Install GPU Tensorflow
- 数据结构--队列
- 283. Move Zeroes
- Leetcode 210. Course Schedule II
- 关于P、NP问题和算法的一点联系
- #6. ZigZag Conversion
- 快速幂及其简单应用
- 1st round, 91 Decode Ways
- Java_每天学习一点点之基本结构
- Leetcode 131. Palindrome Partitioning
- 107. Binary Tree Level Order Traversal II
- 102. Binary Tree Level Order Traversal
- Leetcode 211. Add and Search Word - Data structure design
- 布尔巴基的学术风格