TopCoder problem "JustifyText" used in SRM 233 (Division II Level One)

Problem Statement

We have a collection of Strings, and we want to right justify them. Given a String[] text, your task is to return a String[] containing the same Strings, right justified, in the same order as they appear in text.

The returned Strings should be padded on the left with space characters so that they are all the same length as the longest String in textIn.

Definition

Class:	JustifyText
Method:	format
Parameters:	String[]
Returns:	String[]
Method signature:	String[] format(String[] text)
(be sure your method is public)

Constraints

text will contain between 1 and 50 elements inclusive

each element of text will contain only uppercase letters 'A'-'Z'

each element of text will contain between 1 and 50 characters inclusive

Examples

{"BOB","TOMMY","JIM"}

Returns: {"  BOB", "TOMMY", "  JIM" }

The longest String is "TOMMY" which has 5 characters. So the returned Strings all contain exactly 5 characters.

{"JOHN","JAKE","ALAN","BLUE"}

Returns: {"JOHN", "JAKE", "ALAN", "BLUE" }

No padding is necessary since they all contain the same number of characters.

{"LONGEST","A","LONGER","SHORT"}

Returns: {"LONGEST", "      A", " LONGER", "  SHORT" }

Problem url:

http://www.topcoder.com/stat?c=problem_statement&pm=4017

Problem stats url:

http://www.topcoder.com/tc?module=ProblemDetail&rd=6532&pm=4017

Writer:

lars2520

Testers:

Problem categories:

String Manipulation