Update 1014._Capacity_To_Ship_Packages_Within_D_Days.md

538d9600 · Keqi Huang · GitHub · 48785396 · 538d9600
隐藏空白更改
内联并排

Showing with 1 addition and 1 deletion

docs/Leetcode_Solutions/Python/1014._Capacity_To_Ship_Packages_Within_D_Days.md ...s/Python/1014._Capacity_To_Ship_Packages_Within_D_Days.md +1 -1

未找到文件。
--- a/docs/Leetcode_Solutions/Python/1014._Capacity_To_Ship_Packages_Within_D_Days.md
+++ b/docs/Leetcode_Solutions/Python/1014._Capacity_To_Ship_Packages_Within_D_Days.md
@@ -61,7 +61,7 @@ Note:
 ## 解题方案

 > 思路 1
-******- 时间复杂度: O(N)******- 空间复杂度: O(1)******
+******- 时间复杂度: O(N * lg(sum(weights) - max(weights))******- 空间复杂度: O(1)******

 开始的时候我题目没看清楚，诶，对于第一个例子。
 ```Note that the cargo must be shipped in the order given,