dp
文章平均质量分 78
_xiaoyuer
世界一定有光
展开
-
Codeforces - 358D - Alyona and Strings(dp)
D. Alyona and Stringstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAfter returned from forest, Alyona star原创 2016-07-18 19:33:03 · 400 阅读 · 0 评论 -
HDU - 1506(单调队列) - Largest Rectangle in a Histogram
Largest Rectangle in a HistogramTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 18907 Accepted Submission(s): 5667Problem Descrip原创 2017-07-24 16:07:11 · 294 阅读 · 0 评论 -
LeetCode - 1078(记忆化搜索) - FatMouse and Cheese
FatMouse and CheeseTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10550 Accepted Submission(s): 4452Problem DescriptionFatMo原创 2017-07-24 17:09:06 · 289 阅读 · 0 评论 -
LeetCode - 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 solution原创 2017-08-02 17:59:46 · 209 阅读 · 0 评论 -
LeetCode - 375 - Guess Number Higher or Lower II
We are playing the Guess Game. The game is as follows:I pick a number from 1 to n. You have to guess which number I picked.Every time you guess wrong, I'll tell you whether the number I pi原创 2017-08-02 18:00:04 · 216 阅读 · 0 评论 -
LeetCode - 376 - Wiggle Subsequence
A sequence of numbers is called a wiggle sequence if the differences between successive numbers strictly alternate between positive and negative. The first difference (if one exists) may be either pos原创 2017-08-03 15:14:39 · 150 阅读 · 0 评论 -
LeetCode - 322 - Coin Change
You are given coins of different denominations and a total amount of money amount. Write a function to compute the fewest number of coins that you need to make up that amount. If that amount of money原创 2017-08-10 16:44:30 · 176 阅读 · 0 评论 -
LeetCode - 647 - Palindromic Substrings
Given a string, your task is to count how many palindromic substrings in this string.The substrings with different start indexes or end indexes are counted as different substrings even they consis原创 2017-08-03 22:45:45 · 243 阅读 · 0 评论 -
LeetCode - 650 - 2 Keys Keyboard
Initially on a notepad only one character 'A' is present. You can perform two operations on this notepad for each step:Copy All: You can copy all the characters present on the notepad (partial c原创 2017-08-03 22:46:34 · 335 阅读 · 0 评论 -
LeetCode - 91 - Decode Ways
A message containing letters from A-Z is being encoded to numbers using the following mapping:'A' -> 1'B' -> 2...'Z' -> 26Given an encoded message containing digits, determine the total nu原创 2017-08-11 18:26:29 · 223 阅读 · 0 评论 -
LeetCode - 198/213/337 - House Robber
198. House RobberYou are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of th原创 2017-07-27 23:01:17 · 184 阅读 · 0 评论 -
LeetCode - 96/95 - Unique Binary Search Trees
96. Unique Binary Search TreesGiven 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.原创 2017-08-06 22:06:34 · 183 阅读 · 0 评论 -
HDU - 5115 - Dire Wolf
Dire WolfTime Limit: 5000/5000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others)Total Submission(s): 2575 Accepted Submission(s): 1507Problem DescriptionDire wolves, a原创 2017-08-06 22:06:45 · 225 阅读 · 0 评论 -
加和求不同的组合方式数目(dp)
描述有n个正整数,找出其中和为t(t也是正整数)的可能的组合方式。如:n=5,5个数分别为1,2,3,4,5,t=5;那么可能的组合有5=1+4和5=2+3和5=5三种组合方式。输入输入的第一行是两个正整数n和t,用空格隔开,其中1接下来的一行是n个正整数,用空格隔开。输出和为t的不同的组合方式的数目。样例输入5 51 2转载 2017-08-07 11:29:32 · 552 阅读 · 0 评论 -
LeetCode - 10 - Regular Expression Matching(模式串匹配
Implement regular expression matching with support for '.' and '*'.'.' Matches any single character.'*' Matches zero or more of the preceding element.The matching should cover the entire input st原创 2017-09-02 13:44:35 · 338 阅读 · 0 评论 -
LeetCode - 32 - Longest Valid Parentheses(括号匹配)
Given a string containing just the characters '(' and ')', find the length of the longest valid (well-formed) parentheses substring.For "(()", the longest valid parentheses substring is "()", wh原创 2017-09-02 14:45:11 · 268 阅读 · 0 评论 -
LeetCode - 55 - Jump Game
Given an array of non-negative integers, you are initially positioned at the first index of the array.Each element in the array represents your maximum jump length at that position.Determine i原创 2017-08-08 18:20:32 · 170 阅读 · 0 评论 -
LeetCode - 1059(多重背包二进制优化) - Dividing
Problem DescriptionMarsha and Bill own a collection of marbles. They want to split the collection among themselves so that both receive an equal share of the marbles. This would be easy if all the原创 2017-07-24 15:49:53 · 1281 阅读 · 0 评论 -
HDU - 1025(LIS-O(nlogn)) - Constructing Roads In JGShining's Kingdom
Problem DescriptionJGShining's kingdom consists of 2n(n is no more than 500,000) small cities which are located in two parallel lines.Half of these cities are rich in resource (we call them ri原创 2017-07-24 15:49:27 · 176 阅读 · 0 评论 -
分金子(奇虎360 2017春招真题)
A、B两伙马贼意外地在一片沙漠中发现了一处金矿,双方都想独占金矿,但各自的实力都不足以吞下对方,经过谈判后,双方同意用一个公平的方式来处理这片金矿。处理的规则如下:他们把整个金矿分成n段,由A、B开始轮流从最左端或最右端占据一段,直到分完为止。 马贼A想提前知道他们能分到多少金子,因此请你帮忙计算他们最后各自拥有多少金子?(两伙马贼均会采取对己方有利的策略)原创 2017-03-24 22:25:32 · 1413 阅读 · 0 评论 -
LeetCode - 474 - Ones and Zeroes
In the computer world, use restricted resource you have to generate maximum benefit is what we always want to pursue.For now, suppose you are a dominator of m 0s and n 1s respectively. On the ot原创 2017-04-17 21:47:36 · 220 阅读 · 0 评论 -
LeetCode - 523 - Continuous Subarray Sum
Given a list of non-negative numbers and a target integer k, write a function to check if the array has a continuous subarray of size at least 2 that sums up to the multiple of k, that is, sums up t原创 2017-04-18 22:31:14 · 177 阅读 · 0 评论 -
LeetCode - 516 - Longest Palindromic Subsequence
Given a string s, find the longest palindromic subsequence's length in s. You may assume that the maximum length of s is 1000.Example 1:Input:"bbbab"Output:4One possible longest palind原创 2017-04-18 23:12:41 · 192 阅读 · 0 评论 -
LeetCode - 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 subarray [4,-1,2,1] ha原创 2017-07-11 11:32:56 · 160 阅读 · 0 评论 -
LeetCode - 70 - Climbing Stairs
You are climbing a stair case. It takes n steps to reach to the top.Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?Note: Given n will be a posi原创 2017-07-15 15:00:59 · 169 阅读 · 0 评论 -
LeetCode - 62/63/64 - Unique Paths/Minimum Path Sum
A 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 down or right at any point in time. The robot is trying to reach the bo原创 2017-07-16 09:51:17 · 771 阅读 · 0 评论 -
LeetCode - 303/304 - Range Sum Query - Immutable
303. Range Sum Query - ImmutableGiven an integer array nums, find the sum of the elements between indices i and j (i ≤ j), inclusive.Example:Given nums = [-2, 0, 3, -5, 2, -1]sumRang原创 2017-07-16 09:51:35 · 254 阅读 · 0 评论 -
LeetCode - 357 - Count Numbers with Unique Digits
Given a non-negative integer n, count all numbers with unique digits, x, where 0 ≤ x n.Example:Given n = 2, return 91. (The answer should be the total numbers in the range of 0 ≤ x [11,22,33,44,原创 2017-07-17 10:35:51 · 160 阅读 · 0 评论 -
LeetCode - 494 - Target Sum
You are given a list of non-negative integers, a1, a2, ..., an, and a target, S. Now you have 2 symbols + and -. For each integer, you should choose one from + and - as its new symbol.Find out原创 2017-07-17 10:46:45 · 184 阅读 · 0 评论 -
LeetCode - 416 - Partition Equal Subset Sum
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原创 2017-07-17 11:20:01 · 210 阅读 · 0 评论 -
LeetCode - 120 - Triangle
Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.For example, given the following triangle[ [2], [3,4], [原创 2017-07-19 15:04:28 · 243 阅读 · 0 评论 -
LeetCode - 139/140 - Word Break
Given a non-empty string s and a dictionary wordDict containing a list of non-empty words, determine if s can be segmented into a space-separated sequence of one or more dictionary words. You may as原创 2017-08-01 18:32:13 · 227 阅读 · 0 评论 -
LeetCode - 279 - Perfect Squares
Given a positive integer n, find the least number of perfect square numbers (for example, 1, 4, 9, 16, ...) which sum to n.For example, given n = 12, return 3 because 12 = 4 + 4 + 4; given n =原创 2017-08-01 18:32:27 · 173 阅读 · 0 评论 -
LeetCode - 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 01 0 1 1 11 1 1 1 11 0 0 1 0原创 2017-08-01 18:32:38 · 194 阅读 · 0 评论 -
LeetCode - 300 - Longest Increasing Subsequence
Given an unsorted array of integers, find the length of longest increasing subsequence.For example,Given [10, 9, 2, 5, 3, 7, 101, 18],The longest increasing subsequence is [2, 3, 7, 101], ther原创 2017-08-01 18:32:50 · 152 阅读 · 0 评论 -
LeetCode - 44 - Wildcard Matching(模式串匹配2
Implement wildcard pattern matching with support for '?' and '*'.'?' Matches any single character.'*' Matches any sequence of characters (including the empty sequence).The matching should cover t原创 2017-09-02 16:03:20 · 282 阅读 · 0 评论