leetcode1324

class Solution:
    def printVertically(self, s: str) -> 'List[str]':
        words = s.split(' ')
        matrix = []
        maxlen = 0
        for w in words:
            maxlen = max(maxlen,len(w))
        for word in words:
            matrix.append(word + ' ' * (maxlen - len(word)))
        result = []
        for j in range(maxlen):
            temp = ''
            for i in range(len(words)):
                temp += matrix[i][j]
            result.append(temp.rstrip())
        return result

先结算出最长的单词的长度，然后组成二维数组，按照先列后行的方式遍历，并且对每一个新组成的单词进行右边去空格处理。