LeetCode算法第6题——Z 字形变换

最新推荐文章于 2021-12-21 20:28:05 发布

努力不停努力

最新推荐文章于 2021-12-21 20:28:05 发布

阅读量109

点赞数

分类专栏： Leetcode算法题文章标签： leetcode 算法

本文链接：https://blog.csdn.net/qq_44688635/article/details/104415496

版权

Leetcode算法题专栏收录该内容

51 篇文章 0 订阅

订阅专栏

方法一、找规律解法
按行访问

class Solution {
    public String convert(String s, int numRows) {
        if(s.length() <= numRows || numRows == 1){
            return s;
        }

        int n = 2*numRows - 2;
        String result = new String();

        for(int i = 0 ; i < numRows; i++){
            int j = 2*i;
            //字符串中字符的索引
            int index = i;

            while(index < s.length()){
                result += String.valueOf(s.charAt(index));
                if(n - j != 0){
                    j = n - j;
                }
                index += j;
            }
        }
        return result;
    }
}

二、

import java.util.ArrayList;
import java.util.List;

class Solution {
    public String convert(String s, int numRows) {

        if (numRows == 1) return s;

        List<StringBuilder> rows = new ArrayList<>();
        for (int i = 0; i < Math.min(numRows, s.length()); i++)
            rows.add(new StringBuilder());

        int curRow = 0;
        boolean goingDown = false;

        for (char c : s.toCharArray()) {
            rows.get(curRow).append(c);
            if (curRow == 0 || curRow == numRows - 1) goingDown = !goingDown;
            curRow += goingDown ? 1 : -1;
        }

        StringBuilder ret = new StringBuilder();
        for (StringBuilder row : rows) ret.append(row);
        return ret.toString();
    }
}