{"id":1573,"date":"2023-06-19T18:07:57","date_gmt":"2023-06-19T10:07:57","guid":{"rendered":"https:\/\/xinchewhd.com.cn\/?p=1573"},"modified":"2023-06-19T18:07:57","modified_gmt":"2023-06-19T10:07:57","slug":"%e3%80%90%e7%ae%97%e6%b3%95%e9%a2%98%e8%a7%a3%e3%80%9124-%e6%a8%a1%e6%8b%9f%e6%9c%ba%e5%99%a8%e4%ba%ba%e8%a1%8c%e8%b5%b0","status":"publish","type":"post","link":"https:\/\/xinchewhd.com.cn\/index.php\/%e7%ae%97%e6%b3%95\/%e3%80%90%e7%ae%97%e6%b3%95%e9%a2%98%e8%a7%a3%e3%80%9124-%e6%a8%a1%e6%8b%9f%e6%9c%ba%e5%99%a8%e4%ba%ba%e8%a1%8c%e8%b5%b0\/","title":{"rendered":"\u3010\u7b97\u6cd5\u9898\u89e3\u301124. \u6a21\u62df\u673a\u5668\u4eba\u884c\u8d70"},"content":{"rendered":"
\n
\n
\n
\n
\u8fd9\u662f\u4e00\u9053 \u300c\u4e2d\u7b49\u96be\u5ea6\u300d<\/strong> \u7684\u9898 <\/section>\n<\/section>\n
https:\/\/leetcode.cn\/problems\/walking-robot-simulation<\/span><\/section>\n<\/blockquote>\n


<\/p>\n

<\/span>\u9898\u76ee<\/span><\/span><\/h2>\n

\u673a\u5668\u4eba\u5728\u4e00\u4e2a\u65e0\u9650\u5927\u5c0f\u7684 XY<\/code> \u7f51\u683c\u5e73\u9762\u4e0a\u884c\u8d70\uff0c\u4ece\u70b9 <\/path><\/g><\/path><\/g><\/path><\/g><\/path><\/g><\/path><\/g><\/g><\/g><\/svg><\/span><\/span> \u5904\u5f00\u59cb\u51fa\u53d1\uff0c\u9762\u5411\u5317\u65b9\u3002\u8be5\u673a\u5668\u4eba\u53ef\u4ee5\u63a5\u6536\u4ee5\u4e0b\u4e09\u79cd\u7c7b\u578b\u7684\u547d\u4ee4 <\/path><\/g><\/path><\/g><\/path><\/g><\/path><\/g><\/path><\/g><\/path><\/g><\/path><\/g><\/path><\/g><\/g><\/g><\/svg><\/span><\/span> \uff1a<\/p>\n

    \n
  • \n
    <\/path><\/g><\/path><\/g><\/g><\/g><\/svg><\/span><\/span> \uff1a\u5411\u5de6\u8f6c <\/path><\/path><\/g><\/g><\/g><\/svg><\/span><\/span> \u5ea6<\/section>\n<\/li>\n
  • \n
    <\/path><\/g><\/path><\/g><\/g><\/g><\/svg><\/span><\/span> \uff1a\u5411\u53f3\u8f6c <\/path><\/path><\/g><\/g><\/g><\/svg><\/span><\/span> \u5ea6<\/section>\n<\/li>\n
  • \n
    <\/path><\/g><\/path><\/path><\/g><\/path><\/g><\/path><\/path><\/g><\/path><\/g><\/g><\/g><\/svg><\/span><\/span> \uff1a\u5411\u524d\u79fb\u52a8 <\/path><\/g><\/g><\/g><\/svg><\/span><\/span> \u4e2a\u5355\u4f4d\u957f\u5ea6<\/section>\n<\/li>\n<\/ul>\n

    \u5728\u7f51\u683c\u4e0a\u6709\u4e00\u4e9b\u683c\u5b50\u88ab\u89c6\u4e3a\u969c\u788d\u7269 <\/path><\/g><\/path><\/g><\/path><\/g><\/path><\/g><\/path><\/g><\/path><\/g><\/path><\/g><\/path><\/g><\/path><\/g><\/g><\/g><\/svg><\/span><\/span> \u3002\u7b2c i<\/code> \u4e2a\u969c\u788d\u7269\u4f4d\u4e8e\u7f51\u683c\u70b9 <\/path><\/g><\/path><\/g><\/path><\/g><\/path><\/g><\/path><\/g><\/path><\/g><\/path><\/g><\/path><\/g><\/path><\/g><\/path><\/g><\/path><\/g><\/path><\/g><\/path><\/g><\/path><\/g><\/path><\/g><\/path><\/g><\/path><\/g><\/path><\/g><\/path><\/g><\/path><\/g><\/g><\/g><\/svg><\/span><\/span> \u3002<\/p>\n

    \u673a\u5668\u4eba\u65e0\u6cd5\u8d70\u5230\u969c\u788d\u7269\u4e0a\uff0c\u5b83\u5c06\u4f1a\u505c\u7559\u5728\u969c\u788d\u7269\u7684\u524d\u4e00\u4e2a\u7f51\u683c\u65b9\u5757\u4e0a\uff0c\u4f46\u4ecd\u7136\u53ef\u4ee5\u7ee7\u7eed\u5c1d\u8bd5\u8fdb\u884c\u8be5\u8def\u7ebf\u7684\u5176\u4f59\u90e8\u5206\u3002<\/p>\n

    \u8fd4\u56de\u4ece\u539f\u70b9\u5230\u673a\u5668\u4eba\u6240\u6709\u7ecf\u8fc7\u7684\u8def\u5f84\u70b9\uff08\u5750\u6807\u4e3a\u6574\u6570\uff09\u7684\u6700\u5927\u6b27\u5f0f\u8ddd\u79bb\u7684\u5e73\u65b9\u3002\uff08\u5373\uff0c\u5982\u679c\u8ddd\u79bb\u4e3a <\/path><\/g><\/g><\/g><\/svg><\/span><\/span> \uff0c\u5219\u8fd4\u56de <\/path><\/path><\/g><\/g><\/g><\/svg><\/span><\/span> \uff09<\/p>\n

    \u6ce8\u610f\uff1a<\/p>\n

      \n
    • \n
      \u5317\u8868\u793a +Y \u65b9\u5411\u3002<\/section>\n<\/li>\n
    • \n
      \u4e1c\u8868\u793a +X \u65b9\u5411\u3002<\/section>\n<\/li>\n
    • \n
      \u5357\u8868\u793a -Y \u65b9\u5411\u3002<\/section>\n<\/li>\n
    • \n
      \u897f\u8868\u793a -X \u65b9\u5411\u3002<\/section>\n<\/li>\n<\/ul>\n

      \u793a\u4f8b 1:<\/strong><\/p>\n

      <\/span>func<\/span> robotSim<\/span>(commands []int<\/span>, obstacles [][]int<\/span>)<\/span> int<\/span><\/span> {

          \/\/ \u521d\u59cb\u5316\u969c\u788d\u70b9\u4f4d<\/span>
          obstacleMap := make<\/span>(map<\/span>[[2<\/span>]int<\/span>]bool<\/span>)
          for<\/span> _, obstacle := range<\/span> obstacles {
              obstacleMap[[2<\/span>]int<\/span>{obstacle[0<\/span>], obstacle[1<\/span>]}] = true<\/span>
          }

          \/\/ \u5f53\u524d\u65b9\u5411<\/span>
          dir := 0<\/span>

          \/\/ \u65b9\u5411\u6570\u7ec4<\/span>
          dx, dy := []int<\/span>{0<\/span>, 1<\/span>, 0<\/span>, -1<\/span>}, []int<\/span>{1<\/span>, 0<\/span>, -1<\/span>, 0<\/span>}

          \/\/ \u5f53\u524d\u4f4d\u7f6e<\/span>
          x, y := 0<\/span>, 0<\/span>

          \/\/ \u7b54\u6848<\/span>
          ans := 0<\/span>

          for<\/span> _, command := range<\/span> commands {
              if<\/span> command == -2<\/span> {
                  dir = (dir + 3<\/span>) % 4<\/span>
                  continue<\/span>
              }

              if<\/span> command == -1<\/span> {
                  dir = (dir + 1<\/span>) % 4<\/span>
                  continue<\/span>
              }

              for<\/span> i := 0<\/span>; i < command; i++ {
                  \/\/ \u9047\u5230\u969c\u788d\u7269<\/span>
                  if<\/span> _, ok := obstacleMap[[2<\/span>]int<\/span>{x + dx[dir], y + dy[dir]}]; ok {
                      break<\/span>;
                  }
                  x += dx[dir]
                  y += dy[dir]

                  ans = max(ans, x * x + y * y)
              }
          }

          return<\/span> ans

      }

      func<\/span> max<\/span>(a int<\/span>, b int<\/span>)<\/span> int<\/span><\/span> {
          if<\/span> a > b {
              return<\/span> a
          }
          return<\/span> b
      }
      <\/code><\/pre>\n
      <\/span>\u590d\u6742\u5ea6\u5206\u6790<\/span><\/span><\/h2>\n
        \n
      • \n
        \u65f6\u95f4\u590d\u6742\u5ea6<\/strong>\uff1a<\/path><\/g><\/path><\/g><\/path><\/g><\/path><\/g><\/path><\/g><\/path><\/g><\/path><\/g><\/path><\/g><\/g><\/g><\/svg><\/span><\/span>\uff0c \u5176\u4e2d <\/path><\/g><\/g><\/g><\/svg><\/span><\/span> \u4e3a\u673a\u5668\u4eba\u884c\u8d70\u7684\u6b65\u6570\uff0c<\/path><\/g><\/g><\/g><\/svg><\/span><\/span> \u4e3a\u969c\u788d\u7269\u7684\u4e2a\u6570\uff0c<\/path><\/g><\/g><\/g><\/svg><\/span><\/span>\u4e3a\u8f6c\u6362\u65b9\u5411\u7684\u6b21\u6570\u3002<\/section>\n<\/li>\n
      • \n
        \u7a7a\u95f4\u590d\u6742\u5ea6<\/strong>\uff1a<\/path><\/g><\/path><\/g><\/path><\/g><\/path><\/g><\/g><\/g><\/svg><\/span><\/span>, <\/path><\/g><\/g><\/g><\/svg><\/span><\/span> \u4e3a\u969c\u788d\u7269\u7684\u4e2a\u6570\u3002<\/section>\n<\/li>\n<\/ul>\n

        <\/section>\n
        \n
        \n
        \n
        \n
        \n