算法题
大大的南瓜
在想要成为大神的路上跌跌撞撞
展开
-
Additive equations(dfs)
Additive equations(dfs)题目We all understand that an integer set is a collection of distinct integers. Now the question is: given an integer set, can you find all its addtive equations? To explain wha...原创 2019-12-15 08:35:57 · 215 阅读 · 0 评论 -
Goods Transportation(最大运输量及最小成本)
Goods Transportation(最大运输量及最小成本)题目The transportation problem is to minimize the cost of transporting good from m source nodes to n destination nodes through arcs. Arcs are directed routes from sourc...原创 2019-12-14 19:08:05 · 778 阅读 · 0 评论 -
Entropy(哈夫曼编码)
Entropy(哈夫曼编码)题目题目点这里大概意思是若使用固定长度编码太浪费,可对于不同出现频率的字母采用不同长度的编码,求一种编码方式,使其总长度最小。输入输入一行一串字符,以“END”结束。输出对于每串字符,输出其ASCII码长度、题目要求编码的长度以及这两者之间的比。思路对于ASCII编码,其每个字符编码的长度固定为8,用字符串的长度乘以8即可求出。题目要求的编码方式即为...原创 2019-12-14 17:26:18 · 270 阅读 · 0 评论 -
最长斐波那契子序列(动态规划+哈希表)
最长斐波那契子序列(动态规划+哈希表)题目A sequence of integer numbers a1 , a2 , …, an is called a Fibonacci sequence if ai = ai-2+ai-1 for all i=3,4,…,n.Given a sequence of integer numbers c1 , c2 , …, cm you have to...原创 2019-12-14 16:02:37 · 716 阅读 · 0 评论