如何从最里面的一对开始反转每对匹配括号中包含的字符串？暗斗

Question

到目前为止我已经做到了。我困在递归上了。我不知道如何前进，加入和逆转等等

def callrecursion(s):
    a=s.index('(')
    z=len(s) - string[::-1].index(')') -1
    newStr=s[a+1:z]
# Something is missing here i cant figure it out
    print(newStr)
    return newStr

def reverseParentheses(s):  
    if '(' in s:
        return reverseParentheses(callrecursion(s))        
        print('wabba labba dub dub')
    else:
        return s
string='a(bcdefghijkl(mno)p)q'
reverseParentheses(string)

预期输出：“apmnolkjihgfedcbq”

Answer 1

您的代码中有一些问题，并且缺少很多逻辑。这将调整代码并生成所需的输出：

def callrecursion(s):
    a=s.index('(')
    # 's' not 'string'
    z=len(s) - s[::-1].index(')') -1

    newStr=s[a+1:z][::-1]

    # Need to consider swapped parentheses
    newStr=newStr.replace('(', "$") # Placeholder for other swap
    newStr=newStr.replace(')', "(")
    newStr=newStr.replace('$', ")")

    #Need to recombine initial and trailing portions of original string
    newStr = s[:a] + newStr + s[z+1:]

    return newStr

def reverseParentheses(s):  
    if '(' in s:
        return reverseParentheses(callrecursion(s))        
        print('wabba labba dub dub')
    else:
        return s

string='a(bcdefghijkl(mno)p)q'

print(reverseParentheses(string))
>>>apmnolkjihgfedcbq