wisdompeak / LeetCode

This repository contains the solutions and explanations to the algorithm problems on LeetCode. Only medium or above are included. All are written in C++/Python and implemented by myself. The problems attempted multiple times are labelled with hyperlinks.

Geek Repo:Geek Repo

Github PK Tool:Github PK Tool

对2267题题解文本的改进建议

mingyEx opened this issue · comments

commented

建议添加对2267题剪枝的文字版解释。

你说的剪枝指的是“任意的前缀字符串必须满足左括号的数目不能少于右括号的数目”吗?文字解释里提到了呀。

commented

是指这里对于 (m+n-1)-(i+j+1)>=(x+k)没有解释,看了视频才明白的。

谢谢提醒,已经补充了这一句。