leetcode

module

v0.0.0-...-16b8d63 Latest Latest Go to latest Published: Oct 13, 2020 License: MIT

Details

Path	Synopsis
atcoder
dp T(i, j) 投完前 i 个硬币，j 个 head 的概率 T(1, 0) = 1 - p_1 T(1, 1) = p_1	T(i, j) 投完前 i 个硬币，j 个 head 的概率 T(1, 0) = 1 - p_1 T(1, 1) = p_1
codeforces
1405
669/E
leetcode
3sum
3sum-closest
4sum
binary-tree-maximum-path-sum
course-schedule
create-maximum-number
edit-distance
find-median-from-data-stream
largest-rectangle-in-histogram
letter-combinations-of-a-phone-number
longest-consecutive-sequence
longest-increasing-path-in-a-matrix
longest-palindromic-substring
longest-valid-parentheses
lru-cache
max-points-on-a-line
maximal-rectangle
maximum-performance-of-a-team
merge-k-sorted-lists
minimum-window-substring
regular-expression-matching
remove-nth-node-from-end-of-list
sliding-window-maximum
sliding-window-median
two-sum
wildcard-matching
word-break-ii