题目描述：
Given a sequence of n integers a1, a2, ..., an, a 132 pattern is a subsequence ai, aj, ak such that i < j < k and ai < ...
归档 2016
[LeetCode]132 Pattern
[LeetCode]4Sum II
作者是
发布于
在
LeetCode.
题目描述：
Given four lists A, B, C, D of integer values, compute how many tuples (i, j, k, l) there are such that A[i] + B[j] + C[k] + D[l] is zero.
To make problem ...
[LeetCode]Repeated Substring Pattern
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 459. Repeated Substring Pattern
Given a non-empty string check if it can be constructed by taking a substring of it and appending multiple copies of the substring together. You may assume the given string consists of lowercase English ...
[LeetCode]Assign Cookies
作者是
发布于
在
LeetCode.
题目描述：
Assume you are an awesome parent and want to give your children some cookies. But, you should give each child at most one cookie. Each child i has a greed factor gi, which is ...
倒水概率问题
作者是
发布于
在
数学.
问题描述：
将 1L 水依次倒入 3 个杯子（倒完前 2 杯后，剩余水全部放入第 3 杯），求任意 1 杯水大于 0.5L 的概率。
假设杯子容量大于 1L ，倒出水的体积服从[0, V]上的均匀分布， V 为剩余水的体积。
解题思路：
任意 1 杯水大于 0.5L，可以分解为下面三种情况：
P1. 倒出第一杯水超过 0.5L 的概率为 0.5 ...