Design of leetcode simple problem goal parser

subject

Please design a string that can interpret command Of Goal Parser .command from “G”、"()" and / or “(al)” In a certain order .Goal The parser will “G” Interpreted as a string “G”、"()" Interpreted as a string “o” ,"(al)" Interpreted as a string “al” . then , Concatenate the interpreted strings into a string in the original order .
Here is the string command , return Goal Parser Yes command The result of the explanation is .
Example 1：
Input ：command = “G()(al)”
Output ：“Goal”
explain ：Goal The parser interprets the command as follows ：
G -> G
() -> o
(al) -> al
The final result of the connection is “Goal”
Example 2：
Input ：command = “G()()()()(al)”
Output ：“Gooooal”
Example 3：
Input ：command = “(al)G(al)()()G”
Output ：“alGalooG”
Tips ：
1 <= command.length <= 100
command from “G”、"()" and / or “(al)” In a certain order
source ： Power button （LeetCode）

Their thinking

   This kind of question is relatively simple. You only need to check whether the characters conform to a certain rule according to the rules .

class Solution:
    def interpret(self, command: str) -> str:
        i=0
        temp=''
        while i<len(command):
            if command[i]=='G':
                temp+='G'
                i+=1
            elif command[i]=='(' and command[i+1]==')':
                temp+='o'
                i+=2
            else:
                temp+='al'
                i+=4
        return temp

class Solution:
    def interpret(self, command: str) -> str:
        def change(match):
            char=match.group('char')
            if len(char)==1:
                return 'G'
            elif len(char)==2:
                return 'o'
            else:
                return 'al'
        return re.sub('(?P<char>G|\(\)|\(al\))',change,command)