void M_generate(string item,int left, int right, vector<string>& result)
{
if (left == 0 && right == 0) { result.push_back(item); return; }
if (left > 0) M_generate(item + "(", left - 1, right, result);
if (left < right) M_generate(item + ")", left, right - 1, result);
}
回溯算法之合法括号组合(回溯剪枝)
最新推荐文章于 2022-09-03 22:54:30 发布