归档 2016年11月

题目描述：

LeetCode 456. 132 Pattern

Given a sequence of n integers a₁, a₂, ..., a_n, a 132 pattern is a subsequence a_i, a_j, a_k such that i < j < k and a_i < ...

题目描述：

LeetCode 454. 4Sum II

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 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 455. Assign Cookies

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 g_i, which is ...

问题描述：

将 1L 水依次倒入 3 个杯子（倒完前 2 杯后，剩余水全部放入第 3 杯），求任意 1 杯水大于 0.5L 的概率。

假设杯子容量大于 1L ，倒出水的体积服从[0, V]上的均匀分布， V 为剩余水的体积。

解题思路：

任意 1 杯水大于 0.5L，可以分解为下面三种情况：

P1. 倒出第一杯水超过 0.5L 的概率为 0.5 ...