6. Z 字形变换

最新推荐文章于 2022-04-20 16:03:25 发布

huuuuufei

最新推荐文章于 2022-04-20 16:03:25 发布

阅读量101

点赞数

分类专栏： leetcode算法合集

本文链接：https://blog.youkuaiyun.com/qq_40622253/article/details/114711263

版权

leetcode算法合集专栏收录该内容

15 篇文章

订阅专栏

在这里插入图片描述

class Solution {
    public String convert(String s, int numRows) {
  		int rows = Math.min(s.length(), numRows);
        if(rows == 1) return s;
        int rowIndex = 0;
        StringBuilder result = new StringBuilder();
        List<StringBuilder> list = new ArrayList<>();
        for(int i = 0; i < rows; i++) list.add(new StringBuilder());
        for(int i = 0; i < s.length(); i++){
            int judge = i / (rows - 1);
            int index = 0;
            if(judge % 2 == 0) index = i % (rows - 1);
            else index = rows - 1 - i % (rows - 1);
            list.get(index).append(s.charAt(i));
        }  
        for(StringBuilder rowStr: list) result.append(rowStr);
        return result.toString();
    }
}

这个解法还需要事先对列表赋值，最好能够直接找出结果字符串的指定位置的字符并放进去

class Solution {
    public String convert(String s, int numRows) {
  		int rows = Math.min(s.length(), numRows);
        if(rows == 1) return s;
        StringBuilder result = new StringBuilder();
        for(int i = 0; i < rows; i++){
            int d1 = (rows - 1 - i) * 2;
            int d2 = i * 2;
            int d = 1;
            int current = i;
            while(current < s.length()){
                if(d != 0)
                    result.append(s.charAt(current));
                d = (d == d1) ? d2 : d1;
                current += d;
            }
        }
        return result.toString();
    }
}