{"push_id":592836341,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"1d1d8843700b189c0bfd843306a2a35ee52203ff","before":"27f007190cd02f6926ed349d5cee6b9c54d4140f","commits":[{"sha":"1d1d8843700b189c0bfd843306a2a35ee52203ff","author":{"email":"fc57fe442be21bf41c6df2bc358b934365da7447@foxmail.com","name":"guhao"},"message":"Generate Parentheses\n\n将该问题看作搜索树问题 利用递归的方法求解 利用两个变量记录左括号的个数 和右括号可以匹配的左括号数目","distinct":true,"url":"https://api.github.com/repos/guhaohit/leetcode/commits/1d1d8843700b189c0bfd843306a2a35ee52203ff"}]}