leetcode1138

class Solution:
    def alphabetBoardPath(self, target: str) -> str:
        #a->97
        #z->122
        board = []
        board.append([0,1,2,3,4])
        board.append([5,6,7,8,9])
        board.append([10,11,12,13,14])
        board.append([15,16,17,18,19])
        board.append([0,21,22,23,24])
        board.append([25,-1,-1,-1,-1])
        #print(board)
        path = []
        for c in target:
            asicode = ord(c) - 97
            
            row = asicode // 5
            column = asicode % 5
            path.append((row,column))
        #print(path)

        res = []
        x,y = 0,0
        for p in path:
            while p[0] != x or p[1] != y:
                if p[0] > x and x + 1 < 6 and board[x+1][y] != -1:
                    x += 1
                    res.append('D')
                elif p[0] < x and x - 1 >= 0 and board[x-1][y] != -1:
                    x -= 1
                    res.append('U')
                elif p[1] > y and y + 1 < 5 and board[x][y+1] != -1:
                    y += 1
                    res.append('R')
                elif p[1] < y and y - 1 >= 0 and board[x][y-1] != -1:
                    y -= 1
                    res.append('L')
            if p[0] == x and p[1] == y:
                res.append('!')
        return res