leetcode 刷题 58 59

class Solution:
    def lengthOfLastWord(self, s: str) -> int:
        """
        :type s: str
        :rtype: int
        """
        res = 0
        for i in range(len(s)-1, -1, -1):
            if s[i] == " ":
                if res == 0:
                    continue
                else:
                    return res
            else:
                res += 1
        return res
        # return 0 if len(s.split()) == 0 else len(s.split()[-1])

class Solution:
    def generateMatrix(self, n: int) -> List[List[int]]:
        A = [[0] * n for _ in range(n)]
        i, j, di, dj = 0, 0, 0, 1
        for k in range(n*n):
            A[i][j] = k + 1
            if A[(i+di)%n][(j+dj)%n]:
                di, dj = dj, -di
            i += di
            j += dj
        return A

大神做法