摘要:
最小函数依赖集的求解 一、定义 最小函数依赖集也称为极小函数依赖集、最小覆盖;如果函数依赖集 F 满足下列条件,则称 F 为一个最小依赖集。 二、算法步骤: 将 F 中的所有函数依赖的右边化为单一属性 去掉 F 中的所有函数依赖左边的冗余属性(只针对F中左部不是单一属性的函数依赖) 去掉 F 中的所 阅读全文
摘要:
Minimum Path Sum Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers 阅读全文
摘要:
Interleaving String Given s1, s2, s3, find whether s3 is formed by the interleaving of s1 and s2. For example,Given:s1 = "aabcc",s2 = "dbbca", When s3 阅读全文
摘要:
Say you have an array for which the ith element is the price of a given stock on day i. Design an algorithm to find the maximum profit. You may comple 阅读全文
摘要:
Palindrome Partitioning II Given a string s, partition s such that every substring of the partition is a palindrome. Return the minimum cuts needed fo 阅读全文