Lau_r_k的博客

题目：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

题目： 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: 4 One possible longest

题目：Consider the string s to be the infinite wraparound string of “abcdefghijklmnopqrstuvwxyz”, so s will look like this: “…zabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcd….”. Now we have ano

题目： 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

 题目：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

题目：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

题目： 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 same. For example, these are arithmetic sequ

题目：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

题目：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 m

题目：给出一个数组，玩家1和玩家2轮流从数组的两端无放回地抽取一个数字（玩家1先抽），当数组被抽完时计算两个玩家的数字总和，总和数值大者为胜者。现在给出一个数组，预测玩家1能否胜出。 例子： Input: [1, 5, 2] Output: False Explanation: Initially, player 1 can choose between 1 and 2. If he

题目：给出一个由非负整数组成的数组和整数m，把该数组切分成m个非空连续子数组，并最小化m个子数组总值最大值。 注意：1 ≤ n ≤ 1000，1 ≤ m ≤ min(50, n) 其中n为数组长度。 例子： 输入：nums = [7,2,5,10,8]            m = 2 输出：18 解题思路：显然，无论怎么切分数组，各子数组的总值中的最大值不小于数组中最大的元素。那么

题目：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 potentially a very long (length ~= 500,000) s

题目：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. 题目：给出一个非空正整数数组，问是否能将该数组拆分

 题目：Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number. An example is the root-to-leaf path 1->2->3 which represents the number 123. Find the t

 题目：Given a binary tree, find its minimum depth. The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node. 即求根结点到其叶节点的最短距离。 简单地用BFS就可以解决问

题目： Given a positive integer n, break it into the sum of at least two positive integers and maximize the product of those integers. Return the maximum product you can get. For example, given n =