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 vector <string>, where each element represents one row of the original matrix. Element i of the vector <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 vector <string>, {}.
Definition
Class:
MatrixTool
Method:
convert
Parameters:
string
Returns:
vector <string>
Method signature:
vector <string> convert(string s)
(be sure your method is public)
Constraints
-
s will contain between 1 and 50 digits, inclusive.
Examples
0)
"435245019"
Returns: {"435", "245", "019" }
The example above.
1)
"9"
Returns: {"9" }
2)
"0123456789"
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.
我的程序：
#include <algorithm>
#include <string>
#include <vector>
#include <iostream>
using namespace std;
class MatrixTool
{
public:
vector<string > convert(string s)
{
int sqt[7] = {1, 4, 9, 16, 25, 36, 49};
vector<string > result;
int* p = find(sqt, sqt + 7, s.length());
if (p != sqt + 7)
{
unsigned int n = (unsigned int)(p - sqt) + 1;
size_t len = s.length();
for (unsigned int i=0; i<len; i+=n)
{
result.push_back(s.substr(i, n));
}
}
return result;
}
};
Trackback: http://tb.donews.net/TrackBack.aspx?PostId=638102