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) | |
| |
|
Constraints |
| - |
s will contain between 1 and 50 digits, inclusive. |
Examples |
| 0) |
|
| |
|
|
Returns: {"435", "245", "019" } |
|
| |
| 1) |
|
| |
|
| 2) |
|
| |
|
|
Returns: { } |
| This input has 10 digits, and 10 is not a perfect square. | | |
| 3) |
|
| |
"3357002966366183191503444273807479559869883303524" | |
Returns: {"3357002", "9663661", "8319150", "3444273", "8074795", "5986988", "3303524" } |
| |
This problem statement is the exclusive and proprietary property of TopCoder, Inc. Any unauthorized use or reproduction of this information without the prior written consent of TopCoder, Inc. is strictly prohibited. (c)2003, TopCoder, Inc. All rights reserved.
答案：
1
public class MatrixTool 
{
2
3
public String[] convert(String s){
4 if (s == null || s.length() == 0 || s.length() > 50){
5 return new String[]{};
6
}
7 int length = s.length();
8 int n = (int)Math.sqrt(length);
9 if(n*n == length){
10 String[] result = new String[n];
11 for(int i = 0; i < n; i++){
12 result[i] = s.substring(i*n, i*n + n);
13 }
14 return result;
15 }else {
16 return new String[]{};
17 }
18 }
19
20 /** *//**
21 * @param args
22 */
23 public static void main(String[] args) {
24 MatrixTool matrix = new MatrixTool();
25 String[] result = matrix.convert("3357002966366183191503444273807479559869883303524");
26 for(int i = 0; i < result.length; i++){
27 System.out.println(result[i]);
28 }
29 }
30
31
}
32
posted on 2005-11-27 23:40
風(fēng)蕭蕭 閱讀(739)
評論(0) 編輯 收藏 所屬分類:
雜談