算法
lqcsp
这个作者很懒,什么都没留下…
展开
-
算法乐趣--三只水桶等分水问题
有一个容积为8升的水桶里装满了水,另外还有一个容积为3升的空桶和一个容积为5升的空桶,如何利用这两个空桶等分8升水?附加条件是三个水桶都没有体积刻度,也不能使用其它辅助容器。 这是一道经典题目,一般人都可以在一分钟内给出答案,不过,很多人可能没有注意到这道题的答案不是唯一的。先来看看最常见的一个答案,也是目前已知最快的操作步骤,共需要7次倒水动作:bucket_sta原创 2016-01-22 17:19:01 · 9859 阅读 · 0 评论 -
65. Valid Number
65. Valid NumberProblemValidate if a given string is numeric.Some examples: "0" => true " 0.1 " => true "abc" => false "1 a" => false "2e10" => trueNote: It is intended for the problem statement t原创 2016-08-21 15:52:49 · 366 阅读 · 0 评论 -
37. Sudoku Solver
ProblemWrite a program to solve a Sudoku puzzle by filling the empty cells.Empty cells are indicated by the character .You may assume that there will be only one unique solution. A sudoku puzzle…Solut原创 2016-08-21 16:01:08 · 338 阅读 · 0 评论 -
Shortest substring containing three short strings
@(leetcode)[字符串, Google]ProblemGiven a long string s and short strings t1, t2, t3 (which can have different length) find the shortest substring of s which contains t1, t2 and t3.Example: s = "abcdefgh原创 2016-08-22 16:55:10 · 514 阅读 · 0 评论 -
Find number of subsets with equal sum
@(leetcode)[动态规划|Google]ProblemGiven a number N ( N > 1), gives a set S = [1,2,..., N]. Divide S in two subsets such that S1 ∪ S2 = S and S1 ∩ S2 = Ø and return the number of subsets with equal sum.Ex原创 2016-08-23 13:26:47 · 523 阅读 · 0 评论 -
The longest absolute path in file system
The longest absolute path in file system@(leetcode)[字符串|DFS|Google] The string "dir\n\tsubdir1\n\tsubdir2\n\t\tfile.ext" represents:dir subdir1 subdir2 file.exta directory dir contains an原创 2016-08-23 13:07:48 · 586 阅读 · 0 评论 -
Line reconstruction by height
ProblemSuppose you have a line of n people in which the k-th person is described by a pair (h,t) , where h is the height of the k-th person and t is the number of people in front of k who have a height原创 2016-08-23 16:03:13 · 654 阅读 · 0 评论 -
Split array into two equal sum subArray
@(leetcode)[数组|Google]ProblemA zero-indexed array A consisting of N integers is given. An equilibrium index of this array is any integer P such that 0 ≤ P < N and the sum of elements of lower indices i原创 2016-08-26 18:02:38 · 1421 阅读 · 0 评论