daniel456 - 博客园

2017年10月20日

摘要：【基本问题单元的定义】这取决于你所查看问题的角度，找到一个划分，推进问题的角度十分重要。作者找到的方式是dp[ i ][ j ],用来表示 substring( i , j），然后站在这个角度，假设substring(i , j )中的最大的结果是知道的，那么下一步需要确定的是，其如何影响下一个阶段阅读全文

posted @ 2017-10-20 10:58 daniel456 阅读(335) 评论(0) 推荐(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 o 阅读全文

posted @ 2017-10-20 10:41 daniel456 阅读(151) 评论(0) 推荐(0)

486. Predict the Winner

摘要： Given an array of scores that are non-negative integers. Player 1 picks one of the numbers from either end of the array followed by the player 2 and t 阅读全文

posted @ 2017-10-20 10:34 daniel456 阅读(132) 评论(0) 推荐(0)

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 domin 阅读全文

posted @ 2017-10-20 10:18 daniel456 阅读(120) 评论(0) 推荐(0)

2017年10月19日

464. Can I Win

摘要： In the "100 game," two players take turns adding, to a running total, any integer from 1..10. The player who first causes the running total to reach o 阅读全文

posted @ 2017-10-19 21:08 daniel456 阅读(138) 评论(0) 推荐(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 阅读全文

posted @ 2017-10-19 21:00 daniel456 阅读(102) 评论(0) 推荐(0)

413. Arithmetic Slices

摘要： A sequence of number is called arithmetic if it consists of at least three elements and if the difference between any two consecutive elements is the 阅读全文

posted @ 2017-10-19 20:11 daniel456 阅读(186) 评论(0) 推荐(0)

392. Is Subsequence

摘要： Given a string s and a string t, check if s is subsequence of t. You may assume that there is only lower case English letters in both s and t. t is po 阅读全文

posted @ 2017-10-19 20:08 daniel456 阅读(170) 评论(0) 推荐(0)

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. 阅读全文

posted @ 2017-10-19 20:02 daniel456 阅读(122) 评论(0) 推荐(0)

357. Count Numbers with Unique Digits

摘要： Given a non-negative integer n, count all numbers with unique digits, x, where 0 ≤ x < 10n. Example:Given n = 2, return 91. (The answer should be the 阅读全文

posted @ 2017-10-19 19:26 daniel456 阅读(102) 评论(0) 推荐(0)

andywu

公告