![](https://img-blog.csdnimg.cn/20201014180756926.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
dp
文章平均质量分 68
qq379548839
这个作者很懒,什么都没留下…
展开
-
Leetcode 368. Largest Divisible Subset[medium]
题目: 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, r原创 2016-10-14 22:22:29 · 243 阅读 · 0 评论 -
Leetcode 329. Longest Increasing Path in a Matrix[hard]
题目: Given an integer matrix, find the length of the longest increasing path.From each cell, you can either move to four directions: left, right, up or down. You may NOT move diagonally or move outside原创 2016-10-07 22:42:06 · 226 阅读 · 0 评论 -
Leetcode 416. Partition Equal Subset Sum[medium]
题目: Given a non-empty array containing only positive integers, find if the array can be partitioned into two subsets such that the sum of elements in both subsets is equal.Note: Each of the array ele原创 2016-12-13 21:42:34 · 317 阅读 · 0 评论 -
POJ 1463 Strategic game
题目: Strategic game Time Limit: 2000MS Memory Limit: 10000K Total Submissions: 8051 Accepted: 3746 DescriptionBob enjoys playing computer games, especially strategic games, but sometimes he原创 2016-12-13 21:48:27 · 300 阅读 · 0 评论 -
Leetcode 96. Unique Binary Search Trees[medium]
题目: Given n, how many structurally unique BST’s (binary search trees) that store values 1…n?For example, Given n = 3, there are a total of 5 unique BST’s.1 3 3 2 1 \原创 2016-11-27 19:57:06 · 225 阅读 · 0 评论 -
363. Max Sum of Rectangle No Larger Than K[hard]
题目: Given a non-empty 2D matrix matrix and an integer k, find the max sum of a rectangle in the matrix such that its sum is no larger than k.Example: Given matrix = [ [1, 0, 1], [0, -2, 3] ]原创 2016-11-27 21:05:43 · 419 阅读 · 0 评论