ZigZag Conversion

6. ZigZag Conversion

 

The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility)

P   A   H   N
A P L S I I G
Y   I   R
And then read line by line:  "PAHNAPLSIIGYIR"

Write the code that will take a string and make this conversion given a number of rows:

string convert(string text, int nRows);
convert("PAYPALISHIRING", 3)  should return  "PAHNAPLSIIGYIR" .

代码如下:

import java.io.BufferedReader; 
import java.io.IOException;
import java.io.InputStreamReader;
/**
 * @author leidong
 *
 */
public class ZigZagConvert {
    private static String str;
    private static int nRows;
    
	public static void main(String[] args) throws IOException {
		// TODO Auto-generated method stub
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        System.out.println("Please input the str:");
        str = br.readLine();
        System.out.println("Please input the rows:");
        nRows = Integer.parseInt(br.readLine());
        
        String resultStr = convert(str, nRows);
        
        System.out.println("The result is:");
        System.out.println(resultStr);
	}
	
	/**
	 * ZigZag Conversion
	 * @param str
	 * @param nRows
	 * @return
	 */
	private static String convert(String str, int nRows){
		char[] strChar = str.toCharArray();
		//当行数大于2时,输出结果字符串
		String tempStr = "";
		//除去首尾两行,中间的其他行元素间距
		int distance = 0;
		
		if(nRows == 1 || str == ""){
			return str;
		}

	    for(int i = 0; i < nRows; i++){
		    if(i == 0 || i == nRows - 1){
		    	for(int j = i; j < strChar.length; j += 2 * (nRows - 1)){
				    tempStr += strChar[j];
				    /*System.out.println(tempStr);*/
			    }
		    }
		    else{
		    	int flag = 1;
		        for(int j = i; j < strChar.length ; j += distance){
		    		if(flag == 1){
		        	    tempStr += strChar[j];
		    		    distance = 2 * (nRows - i - 1);
		    		    flag = -flag;
		    		}
		    		else{
		    	     	tempStr += strChar[j];
		    		    distance = 2 * i;
		    		    flag = -flag;
		    		}
		    		/*System.out.println(tempStr);*/
		    	}
		    }
		}
	    return tempStr;
	}
	
}


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值