首页 > 专题系列 > Java解POJ > POJ 2039 To and Fro [解题报告] Java
2013
11-10

POJ 2039 To and Fro [解题报告] Java

To and Fro

问题描述 :

Mo and Larry have devised a way of encrypting messages. They first decide secretly on the number of columns and write the message (letters only) down the columns, padding with extra random letters so as to make a rectangular array of letters. For example, if the message is “There’s no place like home on a snowy night” and there are five columns, Mo would write down
t o i o y

h p k n n
e l e a i
r a h s g
e c o n h
s e m o t
n l e w x

Note that Mo includes only letters and writes them all in lower case. In this example, Mo used the character “x” to pad the message out to make a rectangle, although he could have used any letter.

Mo then sends the message to Larry by writing the letters in each row, alternating left-to-right and right-to-left. So, the above would be encrypted as

toioynnkpheleaigshareconhtomesnlewx

Your job is to recover for Larry the original message (along with any extra padding letters) from the encrypted one.

输入:

There will be multiple input sets. Input for each set will consist of two lines. The first line will contain an integer in the range 2. . . 20 indicating the number of columns used. The next line is a string of up to 200 lower case letters. The last input set is followed by a line containing a single 0, indicating end of input.

输出:

Each input set should generate one line of output, giving the original plaintext message, with no spaces.

样例输入:

5
toioynnkpheleaigshareconhtomesnlewx
3
ttyohhieneesiaabss
0

样例输出:

theresnoplacelikehomeonasnowynightx
thisistheeasyoneab

解题代码:

import java.util.*;   
  
public class Main {   
  
    public static void main(String[] args) {   
        Scanner cin = new Scanner(System.in);   
           
        int num = 0;   
        String str;   
        char[][] array;   
        while(true)   
        {   
            num = Integer.valueOf(cin.nextLine()).intValue();   
            if(num == 0)   
                break;   
            else  
            {   
                str = cin.nextLine();   
                array = convert(str, num);   
                System.out.println(getRawStr(array));   
            }   
        }   
    }   
       
    private static char[][] convert(String str, int col)   
    {          
        int toRight = 1;   
           
        int row = 0;   
        if(str.length()%col == 0)   
            row = str.length()/col;   
        else  
            row = str.length()/col + 1;   
           
        char[][] array = new char[col][row];   
           
        int index = 0;   
        for(int i = 0; i < row; i++)   
        {   
            if(toRight % 2 == 1)   
                for(int j = 0; j < col; j++)   
                    array[j][i] = str.charAt(index++);   
            else  
                for(int j = col-1; j >= 0; j--)   
                    array[j][i] = str.charAt(index++);   
               
            toRight++;   
        }   
           
        return array;   
    }   
       
    private static String getRawStr(char[][] array)   
    {   
        StringBuffer sb = new StringBuffer();   
        for(int i = 0; i < array.length; i++)   
            for(int j = 0; j < array[0].length; j++)   
                sb.append(array[i][j]);   
        return sb.toString();   
    }   
}

  1. 站长好。我是一个准备创业的互联网小白,我们打算做一个有关国*际*游*学的平台。手上也有了一些境外资源。现阶段的团队现在没有cto.原意出让一些管理股寻找一个靠谱的技术专家做合伙人, 不知道是不是能得到您的帮助。发个帖子或者其他方式。期待您的回应。可以加我微信tianxielemon聊聊。