GOOGLE挑战赛练习题2及答案(500分)

博客展示了一段Java代码,定义了MatrixTool类,其中convert方法用于将字符串转换为矩阵。代码会检查字符串长度是否为完全平方数,且字符是否为数字,若符合条件则进行转换。最后在main方法中调用convert方法并输出结果。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

Problem Statement

     A square matrix is a grid of NxN numbers. For example, the following is a 3x3 matrix:
 4 3 5
 2 4 5
 0 1 9
One way to represent a matrix of numbers, each of which is between 0 and 9 inclusive, is as a row-major String. To generate the String, simply concatenate all of the elements from the first row followed by the second row and so on, without any spaces. For example, the above matrix would be represented as "435245019".

You will be given a square matrix as a row-major String. Your task is to convert it into a String[], where each element represents one row of the original matrix. Element i of the String[] represents row i of the matrix. You should not include any spaces in your return. Hence, for the above String, you would return {"435","245","019"}. If the input does not represent a square matrix because the number of characters is not a perfect square, return an empty String[], {}.

Definition

    
Class: MatrixTool
Method: convert
Parameters: String
Returns: String[]
Method signature: String[] convert(String s)
(be sure your method is public)


public class MatrixTool
{

        public String[]  convert(String str)
        {
                String[] matrix = null;
                if(str==null || str.length()<1)
                {
                        return matrix;
                }

                int total = str.length();
                double d = total/1.0;
                int len = (int)Math.sqrt(d);

                //check

                for(int i=0;i<total;i++)
                {

                        if(str.charAt(i)>='0' && str.charAt(i)<='9')
                        {
                        }
                        else
                        {
                                System.out.println("invaid charareter.");
                                return matrix;
                        }
                }

 

                if(len*len == total)
                {
                        matrix = new String[len];
                        for(int i=0;i<len;i++)
                        {
                           matrix[i] = "";
                           for(int j=0;j<len;j++)
                           {
                              matrix[i]+= str.charAt(i*len+j);
                           }
                        }

                }
                return matrix;

        }
       
        public static void main(String args[]){
          MatrixTool mt = new MatrixTool();
          String[] temp = mt.convert("435245019");
          for(int i=0;i<temp.length;i++){
            System.out.println(temp[i]);
          }
        }

}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值