update

Author: ncdhz

code/154.寻找旋转排序数组中的最小值-ii.py

@@ -3,8 +3,26 @@
 #
 # [154] 寻找旋转排序数组中的最小值 II
 #
-
 # @lc code=start
 class Solution:
  def findMin(self, nums: List[int]) -> int:
+ s = 0
+ e = len(nums) - 1
+ while s < e:
+ m = (s + e) // 2
+ n = nums[m]
+ n1, n2 = nums[s], nums[e]
+ if n1 <= n < n2:
+ e = m -1
+ elif n1 < n > n2:
+ s = m + 1
+ elif n1 == n or n2 == n:
+ if n2 == n:
+ e -= 1
+ if n1 == n:
+ s += 1
+ else:
+ e = m
+ 
+ return nums[s]
 # @lc code=end

code/188.买卖股票的最佳时机-iv.py

@@ -0,0 +1,26 @@
+#
+# @lc app=leetcode.cn id=188 lang=python3
+#
+# [188] 买卖股票的最佳时机 IV
+#
+from typing import List
+# @lc code=start
+class Solution:
+ def maxProfit(self, k: int, prices: List[int]) -> int:
+ bs = [0] * (2 * k)
+ for i in range(k):
+ bs[i * 2] = -prices[0]
+ 
+ for price in prices[1:]:
+ for i in range(k):
+ bse = [bs[i * 2]]
+ if i != 0:
+ bse.append(bs[i * 2 - 1] - price)
+ else:
+ bse.append(-price)
+ 
+ bs[i * 2] = max(bse)
+ bs[i * 2 + 1] = max([bs[i * 2] + price, bs[i * 2 + 1]])
+ return max(bs)
+# @lc code=end
+