[Java]算法练习：新农村建设

1 题目描述

from 网友

CASE1

• 输入

A1 A8

• 输出

[A1,A2,A3,A4,A5,A6,A7,A8]

CASE2

• 输入

A1 K1

• 输出

[A1,B1,C1,D1,E1,F1,G1,H1,I1,J1,K1]

2 算法源码

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        String line = scanner.nextLine();
        String [] strArray = line.split(" ");

        // step1 load parameters
        char startChar = strArray[0].charAt(0);
        Integer startIndex = Integer.valueOf(strArray[0].substring(1));

        char endChar = strArray[1].charAt(0);
        Integer endIndex = Integer.valueOf(strArray[1].substring(1));
        //Position end = new Position(endChar, endIndex);

        // step2 generate sequence [m=endChar-startChar, n=endIndex-startIndex]
        int m = endChar-startChar;
        int n = endIndex-startIndex;
        StringBuilder output = new StringBuilder();
        output.append("[");

        for (int j=0;j<=m;j++) {//遍历每一行
            for(int k=0;k<=n;k++){//遍历每一列
                char ch = (char)  ( ((int)startChar) + j);
                int index = startIndex+k;
                output.append(String.valueOf(ch)  + index + ",");
            }
        }
        output = output.deleteCharAt(output.toString().length()-1);
        output.append("]");

        System.out.println(output.toString());

    }
}