DP
xindoo
10年技术博主,博客专家,曾就职于阿里 小米,目前任贝壳资深工程师。拥有运维、搜索广告、后端业务相关工作经验,擅长Java、Lniux、Redis……
展开
-
Leetcode 377. Combination Sum IV
题目链接: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. 赤裸裸的完全背包,属于动态规划的范畴,大家有原创 2016-07-27 20:44:39 · 1966 阅读 · 0 评论 -
Leetcode 53.Maximum Subarray
题目链接:53.Maximum Subarray Find the contiguous subarray within an array (containing at least one number) which has the largest sum. For example, given the array [−2,1,−3,4,−1,2,1,−5,4],the contiguous原创 2016-08-07 16:41:09 · 1457 阅读 · 0 评论 -
Leetcode 368. Largest Divisible Subset思路及详解
题目链接:368. Largest Divisible SubsetGiven 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原创 2016-11-05 17:58:18 · 2130 阅读 · 0 评论 -
Leetcode 467. Unique Substrings in Wraparound String
题目链接:Unique Substrings in Wraparound String Consider the string s to be the infinite wraparound string of “abcdefghijklmnopqrstuvwxyz”, so s will look like this: “…zabcdefghijklmnopqrstuvwxyzabcdefghi原创 2016-12-10 19:22:18 · 1608 阅读 · 0 评论 -
Leetcode 62. Unique Paths & 63. Unique Paths II
好久没刷题了,今天来俩道简单题。 Leetcode 62. Unique Paths Leetcode 63. Unique Paths IIA robot is located at the top-left corner of a m x n grid (marked ‘Start’ in the diagram below). The robot can only move either原创 2017-02-25 15:31:35 · 1510 阅读 · 0 评论