- 博客(7)
- 收藏
- 关注
原创 证明重组问题为NP完全问题
题目原文: 《算法概论》习题8.21 杂化测序。识别新基因的一种实验方法会对该基因进行反复检测,以判断其中包含那些k-串(长度为k的子串)。然后基于它们重组整个基因序列。 我们可以将其描述为一个组合问题。对于任意字符串x(DNA序列),记F(x)为其所有k-串的几何的超集。特别地,F(x)共有|x|-k+1个元素。 重组问题是这样的:给定一个长度为k的字符串组成的多样集,求x使得F(x)恰
2017-01-21 15:00:29
390
原创 Leetcode编程练习:Arithmetic Slices
题目原文:(id=413) A sequence of number is called arithmetic if it consists of at least three elements and if the difference between any two consecutive elements is the same. For example, these are
2017-01-21 11:55:57
290
原创 Leetcode编程练习:H指数
题目原文:(id=274) Given an array of citations (each citation is a non-negative integer) of a researcher, write a function to compute the researcher's h-index. According to the definition of h-inde
2017-01-21 11:38:38
622
原创 Leetcode编程练习:火柴匹配
题目原文:(id=473) Remember the story of Little Match Girl? By now, you know exactly what matchsticks the little match girl has, please find out a way you can make one square by using up all those mat
2017-01-21 11:25:30
761
原创 Leetcode编程练习:课程编排
题目原文:(id=210) There are a total of n courses you have to take, labeled from 0 to n - 1. Some courses may have prerequisites, for example to take course 0 you have to first take course 1, whi
2017-01-21 11:13:45
332
原创 Leetcode编程练习一:盗马三则
Leetcode上有三道连续的题目,名字叫做Horse Robber,下面我们一一描述。 一、Horse Robber(id:198) 原文描述: You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed,
2016-09-10 19:04:44
509
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人