2020年7月4日
[LeetCode] 38. Count and Say
摘要： The count-and-say sequence is a sequence of digit strings defined by the recursive formula: countAndSay(1) = "1" countAndSay(n) is the way you would " 阅读全文
posted @ 2020-07-04 15:00 CNoodle 阅读(555) 评论(0) 推荐(0)
[LeetCode] 957. Prison Cells After N Days
摘要： There are 8 prison cells in a row, and each cell is either occupied or vacant. Each day, whether the cell is occupied or vacant changes according to t 阅读全文
posted @ 2020-07-04 06:20 CNoodle 阅读(323) 评论(0) 推荐(0)
[LeetCode] 32. Longest Valid Parentheses
摘要： Given a string containing just the characters '(' and ')', find the length of the longest valid (well-formed) parentheses substring. Example 1: Input: 阅读全文
posted @ 2020-07-04 04:07 CNoodle 阅读(463) 评论(0) 推荐(0)