Binary search template 二分搜索模板

zxi — Sun, 29 Dec 2019 10:03:36 +0000

Python

# Author: Huahua
# Returns the smallest m in [l, r),
# s.t. cond(m) == True
# If not found returns r.
def binarySearch(l, r)
  while l < r:
    m = l + (r - l) // 2
    if cond(m):
      r = m
    else
      l = m + 1
  return l

C++

// Author: Huahua
// Returns the smallest m in [l, r),
// s.t. cond(m) == True
// If not found returns r.
int binarySearch(int l, int r) {
  while (l < r) {
    int m = l + (r - l) / 2;
    if (cond(m)) r = m;
    else l = m + 1;
  }
  return l;
}

The post Binary search template 二分搜索模板 appeared first on Huahua's Tech Road.

花花酱 LeetCode DP Summary 动态规划总结

zxi — Fri, 02 Nov 2018 06:18:52 +0000

Summary: Input size / sub-problem size / sub-problem complexity / time complexity / space complexity

Category 1.1

Input: O(n)
Sub-problems: O(n)
Each sub-problem depends on O(1) smaller problems
Time complexity: O(n)
Space complexity: O(n) -> O(1)
dp[i] := solution of A[1->i] // prefix

Template

dp = new int[n + 1]
for i = 1 to n:
  dp[i] = f(A[i], dp[i-1], dp[i-2], ...)
return dp[n]

Summary and slides

The post 花花酱 LeetCode DP Summary 动态规划总结 appeared first on Huahua's Tech Road.

template Archives - Huahua's Tech Road

Binary search template 二分搜索模板

Python

C++

Related Articles

花花酱 LeetCode DP Summary 动态规划总结

Category 1.1

Template