首页 > 其他 > 详细

[LeetCode]ZigZag Conversion

时间:2015-12-03 07:09:24      阅读:277      评论:0      收藏:0      [点我收藏+]
public class Solution {
    public String convert(String s, int numRows) {
        if (numRows == 1) {
            return s;
        }
        int flg = 0;
        boolean dir = true;
        List<StringBuffer> list = new ArrayList<StringBuffer>();
        for (int i = 0; i < numRows; i++) {
            list.add(new StringBuffer(""));
        }
        for (int i = 0; i < s.length(); i++) {
            list.get(flg).append(String.valueOf(s.charAt(i)));
            flg += dir ? 1 : -1;
            if (flg == numRows) {
                dir = !dir;
                flg -= 2;
            } else if (flg == -1) {
                dir = !dir;
                flg += 2;
            }
        }
        String result = "";
        for (StringBuffer str : list) {
            result = result + str;
        }
        return result;
    }
}

 

[LeetCode]ZigZag Conversion

原文:http://www.cnblogs.com/vision-love-programming/p/5014914.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!