摘要: DescriptionGiven a directed graph containing n vertice (numbered from 1 to n) and m edges. Can you tell us how many different Hamiltonian Cycles are t... 阅读全文
posted @ 2015-04-06 20:02 HaruHaru 阅读(585) 评论(0) 推荐(0) 编辑
摘要: Say you have an array for which theithelement is the price of a given stock on dayi.Design an algorithm to find the maximum profit. You may complete a... 阅读全文
posted @ 2015-04-06 14:52 HaruHaru 阅读(159) 评论(0) 推荐(0) 编辑