##### Welcome to Subscribe On Youtube

Formatted question description: https://leetcode.ca/all/1324.html

# 1324. Print Words Vertically (Medium)

Given a string s. Return all the words vertically in the same order in which they appear in s.
Words are returned as a list of strings, complete with spaces when is necessary. (Trailing spaces are not allowed).
Each word would be put on only one column and that in one column there will be only one word.

Example 1:

Input: s = "HOW ARE YOU"
Output: ["HAY","ORO","WEU"]
Explanation: Each word is printed vertically.
"HAY"
"ORO"
"WEU"


Example 2:

Input: s = "TO BE OR NOT TO BE"
Output: ["TBONTB","OEROOE","   T"]
Explanation: Trailing spaces is not allowed.
"TBONTB"
"OEROOE"
"   T"


Example 3:

Input: s = "CONTEST IS COMING"
Output: ["CIC","OSO","N M","T I","E N","S G","T"]


Constraints:

• 1 <= s.length <= 200
• s contains only upper case English letters.
• It's guaranteed that there is only one space between 2 words.

Related Topics:
String

## Solution 1.

• class Solution {
public List<String> printVertically(String s) {
String[] array = s.split(" ");
int wordsCount = array.length;
int[] lengths = new int[wordsCount];
int maxLength = 0;
for (int i = 0; i < wordsCount; i++) {
int length = array[i].length();
lengths[i] = length;
maxLength = Math.max(maxLength, length);
}
List<StringBuffer> stringBufferList = new ArrayList<StringBuffer>();
for (int i = 0; i < maxLength; i++)
for (int i = 0; i < wordsCount; i++) {
String word = array[i];
int length = word.length();
for (int j = 0; j < length; j++)
stringBufferList.get(j).append(word.charAt(j));
for (int j = length; j < maxLength; j++)
stringBufferList.get(j).append(' ');
}
for (int i = 0; i < maxLength; i++) {
StringBuffer sb = stringBufferList.get(i);
while (sb.charAt(sb.length() - 1) == ' ')
sb.deleteCharAt(sb.length() - 1);
stringBufferList.set(i, sb);
}
List<String> verticalList = new ArrayList<String>();
for (int i = 0; i < maxLength; i++)
return verticalList;
}
}

############

class Solution {
public List<String> printVertically(String s) {
String[] words = s.split(" ");
int n = 0;
for (var w : words) {
n = Math.max(n, w.length());
}
List<String> ans = new ArrayList<>();
for (int j = 0; j < n; ++j) {
StringBuilder t = new StringBuilder();
for (var w : words) {
t.append(j < w.length() ? w.charAt(j) : ' ');
}
while (t.length() > 0 && t.charAt(t.length() - 1) == ' ') {
t.deleteCharAt(t.length() - 1);
}
}
return ans;
}
}

• // OJ: https://leetcode.com/problems/print-words-vertically/
// Time: O(S)
// Space: O(S)
class Solution {
public:
vector<string> printVertically(string s) {
vector<string> v, ans;
stringstream ss(s);
string word;
int maxLen = 0;
while (ss >> word) {
v.push_back(word);
maxLen = max(maxLen, (int)word.size());
}
for (int i = 0; i < maxLen; ++i) {
string word;
for (int j = 0; j < v.size(); ++j)
word += i < v[j].size() ? v[j][i] : ' ';
while (word.back() == ' ') word.pop_back();
ans.push_back(word);
}
return ans;
}
};

• class Solution:
def printVertically(self, s: str) -> List[str]:
words = s.split()
m, n = len(words), max(len(word) for word in words)
ans = []
for j in range(n):
t = []
for i in range(m):
word = words[i]
t.append(word[j] if j < len(word) else ' ')
ans.append(''.join(t).rstrip())
return ans

############

# 1324. Print Words Vertically
# https://leetcode.com/problems/print-words-vertically/

class Solution:
def printVertically(self, s: str) -> List[str]:
words = s.split(" ")
m = len(max(words, key=len))
n = len(words)
res = ["" for _ in range(m)]

for i,x in enumerate(words):
for j in range(m):
if j >= len(x):
res[j] += " "
else:
res[j] += x[j]

for i in range(m):
res[i] = res[i].rstrip()

return res


• func printVertically(s string) (ans []string) {
words := strings.Split(s, " ")
n := 0
for _, w := range words {
n = max(n, len(w))
}
for j := 0; j < n; j++ {
t := []byte{}
for _, w := range words {
if j < len(w) {
t = append(t, w[j])
} else {
t = append(t, ' ')
}
}
for len(t) > 0 && t[len(t)-1] == ' ' {
t = t[:len(t)-1]
}
ans = append(ans, string(t))
}
return
}

func max(a, b int) int {
if a > b {
return a
}
return b
}