1493. 模拟行走机器人

class Solution:
    """
    @param commands: type: List[int]
    @param obstacles: type: List[List[int]]
    @return: Return the square of the maximum Euclidean distance
    """
    ‘‘‘
    大致思路:
    1.初始化p=‘top‘,dic = [‘top‘,‘right‘,‘down‘,‘left‘],c=[0,0]最开始的坐标，dic_x,dic_y分别代表往这个方向走则是加还是减。
    2.while commands  != [],循环，每次pop掉首个值，如果当前值== -1,则取后一个值。如果当前p为left and pop_num == -2,则置0。 -2一样
    3.如果当前值是大于0的话，则根据对应的p，进行该方向的行走，同时记录该坐标，如果该坐标的下一位存在障碍物列表里面的话，则continue
    4.最终返回x和y轴的平方和即可
    ‘‘‘
    def robotSim(self, commands, obstacles):
        p = ‘top‘
        dic = [‘top‘,‘right‘,‘down‘,‘left‘]
        dic_x = {‘right‘:1,‘left‘:-1}
        dic_y = {‘top‘:1,‘down‘:-1}
        c = [0,0]

        while commands != []:
            pop_num = commands.pop(0)
            
            #反向的转换
            if pop_num < 0:
                #向右转
                if pop_num == -1:
                    if p != ‘left‘:
                        p = dic[dic.index(p)+1]
                    else:
                        p = ‘top‘

                #向左转
                if pop_num == -2:
                    if p != ‘top‘:
                        p = dic[dic.index(p)-1]
                    else:
                        p = ‘left‘

            
            #该方向的行走
            else:
                if p in [‘left‘,‘right‘]:
                    for i in range(pop_num):
                        x = c[0] + dic_x[p]
                        y = c[1]
                        if [x,y] in obstacles:
                            break
                        c = [x,y]
                
                elif p in [‘top‘,‘down‘]:
                    for i in range(pop_num):
                        x = c[0] 
                        y = c[1] + dic_y[p]
                        if [x,y] in obstacles:
                            break     
                        c = [x,y]  
        return c[0]**2 + c[1]**2