2020年3月19日
[LeetCode] 1183. Maximum Number of Ones
摘要： Consider a matrix M with dimensions width * height, such that every cell has value 0 or 1, and any square sub-matrix of M of size sideLength * sideLen 阅读全文
posted @ 2020-03-19 05:26 Review->Improve 阅读(4310) 评论(0) 推荐(0)
[LeetCode] 301. Remove Invalid Parentheses
摘要： Remove the minimum number of invalid parentheses in order to make the input string valid. Return all possible results. Note: The input string may cont 阅读全文
posted @ 2020-03-19 02:12 Review->Improve 阅读(228) 评论(0) 推荐(0)