动态规划/
LUCASYAN个
这个作者很懒,什么都没留下…
展开
-
264. Ugly Number II 剑指offer
Write a program to find the n-th ugly number.Ugly numbers are positive numbers whose prime factors only include 2, 3, 5. For example, 1, 2, 3, 4, 5, 6, 8, 9, 10, 12 is the sequence of the first原创 2017-09-13 14:05:21 · 177 阅读 · 0 评论 -
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-09-12 23:34:56 · 156 阅读 · 0 评论 -
动态规划之极小化极大值问题 375. Guess Number Higher or Lower II
这类题目思想是两层极值问题。比如要求求出一个极大值,而这个极大值的选择是在众多的极小值中选择的。1、375. Guess Number Higher or Lower II在1~n中给定一个数,要求猜测这个数是多少,最后猜出这个数的代价是之前猜的数的和。在374类似问题中,是求解最少的猜测次数,使用二分法的思想。这个题目如果受这种思想的限制,就想不到一个合适的解法。回归到最一般原创 2017-09-20 17:26:28 · 1308 阅读 · 1 评论 -
分金子(360公司2017春招真题) 纸牌博弈问题 程序员代码面试指南
A、B两伙马贼意外地在一片沙漠中发现了一处金矿,双方都想独占金矿,但各自的实力都不足以吞下对方,经过谈判后,双方同意用一个公平的方式来处理这片金矿。处理的规则如下:他们把整个金矿分成n段,由A、B开始轮流从最左端或最右端占据一段,直到分完为止。 马贼A想提前知道他们能分到多少金子,因此请你帮忙计算他们最后各自拥有多少金子?(两伙马贼均会采取对己方有利的策略)输入原创 2017-09-18 20:00:56 · 948 阅读 · 0 评论 -
368. Largest Divisible Subset
Given an encoded string, return it's decoded string.The encoding rule is: k[encoded_string], where the encoded_string inside the square brackets is being repeated exactly k times. Note that k is原创 2017-09-16 09:03:20 · 228 阅读 · 0 评论 -
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-09-16 08:59:39 · 247 阅读 · 0 评论 -
309. Best Time to Buy and Sell Stock with Cooldown
Say you have an array for which the ith element is the price of a given stock on day i.Design an algorithm to find the maximum profit. You may complete as many transactions as you like (ie, buy on原创 2017-09-16 08:59:15 · 213 阅读 · 0 评论 -
312 Burst Balloons
Given n balloons, indexed from 0 to n-1. Each balloon is painted with a number on it represented by array nums. You are asked to burst all the balloons. If the you burst balloon i you will get num原创 2017-09-16 08:58:35 · 170 阅读 · 0 评论 -
542. 01 Matrix 寻找最近的0 重点 BFS 动态规划
Given a matrix consists of 0 and 1, find the distance of the nearest 0 for each cell.The distance between two adjacent cells is 1.Example 1: Input:0 0 00 1 00 0 0Output:0 0 00 1 00原创 2017-09-15 10:52:59 · 599 阅读 · 0 评论 -
466. Count The Repetitions
Define S = [s,n] as the string S which consists of n connected strings s. For example, ["abc", 3] ="abcabcabc".On the other hand, we define that string s1 can be obtained from string s2 if we ca原创 2017-09-07 23:00:05 · 911 阅读 · 0 评论 -
576. Out of Boundary Paths
There are N gas stations along a circular route, where the amount of gas at station i is gas[i].You have a car with an unlimited gas tank and it costs cost[i] of gas to travel from station i to原创 2017-09-05 00:07:37 · 206 阅读 · 0 评论 -
313. Super Ugly Number
Write a program to find the nth super ugly number.Super ugly numbers are positive numbers whose all prime factors are in the given prime list primes of size k. For example, [1, 2, 4, 7, 8, 13,原创 2017-09-13 14:50:20 · 133 阅读 · 0 评论 -
467. Unique Substrings in Wraparound String
Consider the string s to be the infinite wraparound string of "abcdefghijklmnopqrstuvwxyz", so s will look like this: "...zabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcd....".Now we have原创 2017-09-22 09:58:08 · 290 阅读 · 0 评论