题解 | #坐标移动#

#include <stdio.h>
void judge(char std[], int(*p)[2], int i, int hash[])
{
    int num = 0;
    if (i >= 2 && i <= 3)
    {
        if ((std[1]>='0'&& std[1] <= '9'))
        {
            if (i == 3&& (std[2] >= '0' && std[2] <= '9'))
            {
                num = (std[1] - '0') * 10 + (std[2] - '0');
            }
            else if(i==2)
            {
                num = std[1] - '0';
            }
            if (std[0] == 'A' || std[0] == 'D')
            {
                (*p)[0] += hash[std[0]] * num;
            }
            else if (std[0] == 'W' || std[0] == 'S')
            {
                (*p)[1] += hash[std[0]] * num;
            }
        }
    }
}
int main()
{
    int arr1[2] = { 0 };
    int* p = arr1;
    char std[1000] = { 0 };
    char word = getchar();
    int hash[127] = { 0 };
    hash['A'] = -1;
    hash['D'] = 1;
    hash['W'] = 1;
    hash['S'] = -1;
    while (word != '\n')
    {
        int i = 0;
        while (word != ';')
        {
            std[i++] = word;
            word = getchar();
        }
        judge(std, &arr1, i, hash);
        word = getchar();
    }
    printf("%d,%d\n", arr1[0], arr1[1]);
    return 0;
}