https://oj.leetcode.com/problems/zigzag-conversion/
O(n) time complexity, O(1) space complexity.
Control the gaps between neighbouring numbers in each output line, 380 ms time cost.
| Name | Name | Last commit date | ||
|---|---|---|---|---|
parent directory.. | ||||
https://oj.leetcode.com/problems/zigzag-conversion/
O(n) time complexity, O(1) space complexity.
Control the gaps between neighbouring numbers in each output line, 380 ms time cost.