中級 0件解決済み 正答率0%

Robot Command Simulator

Move a robot using L (turn left 90 degrees), R (turn right 90 degrees), and A (advance one step).

問題

Move a robot using L (turn left 90 degrees), R (turn right 90 degrees), and A (advance one step). Turning does not move it. Positive x points east and positive y points north. Directions are encoded as 0 = north, 1 = east, 2 = south, 3 = west. There are no obstacles or boundaries.

Implement robot_command_simulator(x, y, direction, commands).

Input

x: Initial horizontal coordinate.

y: Initial vertical coordinate.

direction: Initial direction: 0 north, 1 east, 2 south, 3 west.

commands: Commands to process from left to right.

Output

Return [final_x, final_y, final_direction], using the same direction encoding.

制約

−1,000,000,000 ≤ initial x, y ≤ 1,000,000,000. Direction is 0…3. There are 0…100,000 commands, each uppercase L, R, or A.

例

例 1
入力:
x = 0
y = 0
commands = "RAALA"
direction = 0

期待される出力:
expected = [2, 1, 0]
入力:
long long x = 0;
long long y = 0;
std::string commands = "RAALA";
long long direction = 0;

期待される出力:
std::vector<long long> expected = {2, 1, 0};
入力:
long x = 0;
long y = 0;
string commands = "RAALA";
long direction = 0;

期待される出力:
long[] expected = new long[] {2, 1, 0};

解説

Turn east, advance twice to (2, 0), turn north, then advance to (2, 1). Direction 0 means north.

例 2
入力:
x = 3
y = -2
commands = "LLLL"
direction = 1

期待される出力:
expected = [3, -2, 1]
入力:
long long x = 3;
long long y = -2;
std::string commands = "LLLL";
long long direction = 1;

期待される出力:
std::vector<long long> expected = {3, -2, 1};
入力:
long x = 3;
long y = -2;
string commands = "LLLL";
long direction = 1;

期待される出力:
long[] expected = new long[] {3, -2, 1};

解説

Four left turns restore the original east-facing direction (1). Turning never changes the coordinates.

参考資料

この課題はCodeUtility用に調整されています。上記の説明と制約に従ってください。

他の人の解答から学ぶ

コミュニティの解答

まだ公開された解答がありません。この課題を解いて最初の解答を共有しましょう。