Description

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:
    def printVertically(self, s: str) -> List[str]:
        arr=s.split()
        n=0
        for item in arr:
            n=max(n,len(item))
        res=[]
        for i in range(n):
            t=''
            for item in arr:
                if(i<len(item)):
                    t+=item[i]
                else:
                    t+=' '
            res.append(t.rstrip())
        return res