1041. Robot Bounded In Circle

On an infinite plane, a robot initially stands at (0, 0) and faces north.  The robot can receive one of three instructions:

• "G": go straight 1 unit;
• "L": turn 90 degrees to the left;
• "R": turn 90 degress to the right.

The robot performs the instructions given in order, and repeats them forever.

Return true if and only if there exists a circle in the plane such that the robot never leaves the circle.

 

Example 1:

Input: "GGLLGG"
Output: true
Explanation: 
The robot moves from (0,0) to (0,2), turns 180 degrees, and then returns to (0,0).
When repeating these instructions, the robot remains in the circle of radius 2 centered at the origin.

Example 2:

Input: "GG"
Output: false
Explanation: 
The robot moves north indefinetely.

Example 3:

Input: "GL"
Output: true
Explanation: 
The robot moves from (0, 0) -> (0, 1) -> (-1, 1) -> (-1, 0) -> (0, 0) -> ...

 

Note:

1. 1 <= instructions.length <= 100
2. instructions[i] is in {'G', 'L', 'R'}

思路：有2种情况会形成循环

1. 经过一个周期回到原点

2. 经过一个周期没有回到原点，但是方向变了（经过若干个循环后一定会回到原点）

class Solution(object):
    def isRobotBounded(self, instructions):
        """
        :type instructions: str
        :rtype: bool
        """
        p=[0,0]
        ds=[[0,1],[1,0],[0,-1],[-1,0]]
        i=0
        for s in instructions:
            if s=='G': 
                p[0],p[1]=p[0]+ds[i][0],p[1]+ds[i][1]
            elif s=='L':
                i-=1
            else:
                i+=1
            i=(i+4)%4
        return (p[0]==0 and p[1]==0) or i!=0