LeetCode-1324. Print Words Vertically

LeetCode-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 printVertically(string s) { vector word; string tmp = ""; int len = 0; for (int i = 0; i < s.length(); i++) { if (s[i] != ' ') { tmp += s[i]; } else { word.push_back(tmp); int tmplen = tmp.length(); len = max(len, tmplen); tmp.clear(); } } word.push_back(tmp); int tmplen = tmp.length(); len = max(len, tmplen); vector res; for (int k = 0; k < len; k++) { string cur = ""; for (int i = 0; i < word.size(); i++) { if (word[i].length() > k) { cur += word[i][k]; } else { cur += ' '; } } while (cur.back() == ' ') { cur.pop_back(); } res.push_back(cur); } return res; }};

版权声明：本文内容由网络用户投稿，版权归原作者所有，本站不拥有其著作权，亦不承担相应法律责任。如果您发现本站中有涉嫌抄袭或描述失实的内容，请联系我们jiasou666@gmail.com 处理，核实后本网站将在24小时内删除侵权内容。