update

Author: ncdhz

code/241.为运算表达式设计优先级.py

@@ -3,24 +3,30 @@
 #
 # [241] 为运算表达式设计优先级
 #
-
+from functools import cache
 # @lc code=start
 class Solution:
 
+ @cache
  def diffWaysToCompute_(self, numbers, symbols):
  if len(symbols) == 0:
  return numbers
  res = []
  for i in range(1, len(numbers)):
+ 
+ left = self.diffWaysToCompute_(numbers[:i], symbols[:i-1])
+ right = self.diffWaysToCompute_(numbers[i:], symbols[i:])
  symbol = symbols[i - 1]
- if symbol == '+':
- number = numbers[i] + numbers[i - 1]
- elif symbol == '-':
- number = numbers[i - 1] - numbers[i]
- else:
- number = numbers[i] * numbers[i - 1]
 
- res.extend(self.diffWaysToCompute_([*numbers[:i-1], number, *numbers[i+1:]], [*symbols[:i - 1], *symbols[i:]]))
+ for l in left:
+ for r in right:
+
+ if symbol == '+':
+ res.append(l + r)
+ elif symbol == '-':
+ res.append(l - r)
+ else:
+ res.append(l * r)
  return res
 
 
@@ -36,6 +42,5 @@ def diffWaysToCompute(self, expression: str) -> List[int]:
  number = ''
  symbols.append(exp)
  numbers.append(int(number))
- return self.diffWaysToCompute_(numbers, symbols)
-
+ return self.diffWaysToCompute_(tuple(numbers), tuple(symbols))
 # @lc code=end

code/300.最长递增子序列.py

@@ -0,0 +1,28 @@
+#
+# @lc app=leetcode.cn id=300 lang=python3
+#
+# [300] 最长递增子序列
+#
+
+# @lc code=start
+class Solution:
+ def lengthOfLIS(self, nums: List[int]) -> int:
+ max_ = 0
+ max_dict = {}
+ for n in nums:
+ m = 1
+ for i in range(max_, 0, -1):
+ x = max_dict.get(i, None)
+ if x is not None and n > x:
+ m = i + 1
+ if m != 1:
+ break
+ x = max_dict.get(m, None)
+ if x is None or x > n:
+ max_dict[m] = n
+
+ if m > max_:
+ max_ = m
+ return max_
+# @lc code=end
+