# 1324. Print Words Vertically

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.

``````class Solution {
public:
vector<string> printVertically(string s) {
istringstream iss(s);
string t = "";
vector<string> words;
int mxLen = 0;
while (iss >> t) {
mxLen = max(mxLen, (int)t.size());
words.push_back(t);
}
vector<string> res(mxLen);
for (int i = 0; i < mxLen; ++i) {
for (string word : words) {
if (i >= word.size()) res[i].push_back(' ');
else res[i].push_back(word[i]);
}
while (res[i].back() == ' ') res[i].pop_back();
}
return res;
}
};
``````

Github 同步地址:

https://github.com/grandyang/leetcode/issues/1324

https://leetcode.com/problems/print-words-vertically/

https://leetcode.com/problems/print-words-vertically/solutions/484776/c-max-size/

LeetCode All in One 题目讲解汇总(持续更新中…)

（欢迎加入博主的知识星球，博主将及时答疑解惑，并分享刷题经验与总结，快快加入吧～）

|

Venmo 打赏

—|—

 微信打赏 Venmo 打赏
（欢迎加入博主的知识星球，博主将及时答疑解惑，并分享刷题经验与总结，试运营期间前五十位可享受半价优惠～）

×

Help us with donation