- 博客(9)
- 资源 (5)
- 收藏
- 关注
原创 算法概论chapter8-8.15解题报告
题目最大公共子图:证明如下问题是NP-完全的:输入:两个图G1=(V1,E1)和G2=(V2,E2);预算b输出:两个节点集合V1’和V2’分别是V1和V2的子集,它们被移除后,将在两图中分别留下至少b个节点,且图的剩余部分完全一样题意分析给定两个图G1,G2,G1去掉一些定点V1’,G2去掉一些定点V2’之后,两个图都得到结点数至少为b的子图,且这两个子图完全相同。证明要证一个问题是NP-com
2017-12-28 16:47:00 221
原创 动态规划解377. Combination Sum IV
题目Given an integer array with all positive numbers and no duplicates, find the number of possible combinations that add up to a positive integer target.nums = [1, 2, 3]target = 4The possible combinat
2017-12-24 12:02:24 196
原创 动态规划解368. Largest Divisible Subset
题目Given a set of distinct positive integers, find the largest subset such that every pair (Si, Sj) of elements in this subset satisfies: Si % Sj = 0 or Sj % Si = 0.If there are multiple solutions, retu
2017-12-24 00:43:49 437
原创 357. Count Numbers with Unique Digits解题报告
题目Given a non-negative integer n, count all numbers with unique digits, x, where 0 ≤ x 10^n.Example:Given n = 2, return 91. (The answer should be the total numbers in the range of 0 ≤ x 100, excludi
2017-12-10 12:28:12 192
原创 动态规划解338. Counting Bits
题目Given a non negative integer number num. For every numbers i in the range 0 ≤ i ≤ num calculate the number of 1’s in their binary representation and return them as an array.Example:For num = 5 you s
2017-12-05 23:57:23 220
原创 动态规划解221. Maximal Square
题目Given a 2D binary matrix filled with 0’s and 1’s, find the largest square containing only 1’s and return its area.For example, given the following matrix: 1 0 1 0 0 1 0 1 1 1 1 1 1 1 1
2017-12-05 23:03:41 182
原创 动态规划解343. Integer Break
题目Given a positive integer n, break it into the sum of at least two positive integers and maximize the product of those integers. Return the maximum product you can get.For example, given n = 2, return
2017-12-04 23:37:46 226
原创 动态规划解337. House Robber III
题目The thief has found himself a new place for his thievery again. There is only one entrance to this area, called the “root.” Besides the root, each house has one and only one parent house. After a tou
2017-12-04 23:04:36 191
原创 318. Maximum Product of Word Lengths解题报告
题目Given a string array words, find the maximum value of length(word[i]) * length(word[j]) where the two words do not share common letters. You may assume that each word will contain only lower case let
2017-12-04 09:21:10 176
无监督学习方法以及应用
2018-06-03
图灵程序设计丛书 机器学习 弗拉赫
2018-05-26
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人