LeetCode 1138：字母板上的路径（Alphabet Board Path）解法汇总

最新推荐文章于 2023-02-12 13:59:08 发布

Ubuntu1996

最新推荐文章于 2023-02-12 13:59:08 发布

阅读量416

点赞数

分类专栏： LeetCode刷题题解记录文章标签： LeetCode 字母板上的路径 Alphabet Board Path

本文链接：https://blog.csdn.net/Utopiabuntu/article/details/97613090

版权

On an alphabet board, we start at position (0, 0), corresponding to character board[0][0].

Here, board = ["abcde", "fghij", "klmno", "pqrst", "uvwxy", "z"].

We may make the following moves:

'U' moves our position up one row, if the square exists;
'D' moves our position down one row, if the square exists;
'L' moves our position left one column, if the square exists;
'R' moves our position right one column, if the square exists;
'!' adds the character board[r][c] at our current position (r, c) to the answer.

Return a sequence of moves that makes our answer equal to target in the minimum number of moves. You may return any path that does so.

Example 1:

Input: target = “leet”
Output: “DDR!UURRR!!DDD!”

Example 2:

Input: target = “code”
Output: “RR!DDRR!UUL!R!”

Constraints:

Solution

求得当前字母的位置相对于前一字母的位置的x y位移即可。

要注意的是z这个字母，从它出去只能先上后右，进入它只能先做后下。

class Solution {
   
public:
    string alphabetBoardPath(string target) {
   
        string path;
        int x_index = 0;

关注