Problem Statement | |||||||||||||
In the process of constructing a computer science building at a university, it was decided that a hidden message would be included in the brick patterns. Each character in the message will be represented by a row of nine slots. Each slot will either contain a brick or remain empty. The first and last slots in a row will always be empty. The other seven slots will represent the character's 7-bit ASCII value in binary (most significant digit first), with empty slots where a binary 1 would be written. Additionally, for increased aesthetic value, a character with ASCII value zero is added before and after the message . The characters will be arranged sequentially from the top: the first character in the topmost row, the second right below it, etc. Given a String message, return the pattern as a String[], where each String represents one row and each character in the strings is either 'x' (empty) or '.' (brick). The rows in the return should be ordered top to bottom. | |||||||||||||
Definition | |||||||||||||
| |||||||||||||
Constraints | |||||||||||||
| - | message will contain between 0 and 50 characters, inclusive. | ||||||||||||
| - | Each character in message will have ASCII value between 32 and 126, inclusive. | ||||||||||||
Examples | |||||||||||||
| 0) | |||||||||||||
| |||||||||||||
| 1) | |||||||||||||
| |||||||||||||
| 2) | |||||||||||||
| |||||||||||||