add lintcode 1699

supinyu · supinyu · commit 7e0198d50069 · 2019-12-17T00:11:04.000+08:00
diff --git a/README.md b/README.md
@@ -13,4 +13,5 @@ LintCode|74 | 第一个错误的代码版本 | 一刷无bug |
 LintCode|75 | 寻找峰值 | 一刷有点小问题 |
 LintCode|159|寻找旋转排序数组中的最小值|一刷无bug|
 LintCode|160|寻找旋转排序数组中的最小值 II|有大量重复元素|
-LintCode|585 | 山脉序列中的最大值 | 一刷无bug |
+LintCode|585 | 山脉序列中的最大值 | 一刷无bug |
+LintCode|1699 | 建庙 | 二分法的变形 |
diff --git a/python/lintcode_1669.py b/python/lintcode_1669.py
@@ -0,0 +1,29 @@
+class Solution:
+    """
+    @param m: m pillars of your temple.
+    @param woods: length of n different wood
+    @return: return the maximum height of the temple.
+    """
+
+    def buildTemple(self, m, woods):
+        # write your code here.
+        if m < 1 or len(woods) < 1:
+            return 0
+        start = min(woods)
+        end = max(woods)
+        while start + 1 < end:
+            mid = start + (end - start) // 2
+            if self.helper(woods, mid) < m:
+                end = mid
+            else:
+                start = mid
+        if self.helper(woods, start) >= m:
+            return start
+        else:
+            return end
+
+    def helper(self, woods, eachlen):
+        count = 0
+        for wood in woods:
+            count = count + wood // eachlen
+        return count
