Learn From The Masters

题目描述 一只青蛙一次可以跳上1级台阶，也可以跳上2级。求该青蛙跳上一个n级的台阶总共有多少种跳法。思路： 当要跳1阶时为1种，要跳2阶时为2种，当跳n（n>2）阶时，种数为前两个种数相加。 递归调用的时间太长，这在斐波那契数列的题中已经说过 代码：class Solution {public: int jumpFloor(int number) { if(numb

题目： On a staircase, the i-th step has some non-negative cost cost[i] assigned (0 indexed).Once you pay the cost, you can either climb one or two steps. You need to find minimum cost to reach the to...

最长公共子序列问题也就是如在两个不同的字符串中找出最长的公共子序列例：字符串x = "ABCBDAB"字符串y = "BDCABA" 可以看出他们的公共子序列是 BCBA，但是对于较长的字符串，肉眼很难去判断，如果用枚举，那么其算法复杂度为O(2m{2^m})就要寻找一种算法复杂度较低的算法 ，就是先比较字符串x和y各个字符已经有几个相同的情况，存在c中，空间复杂度和时间复杂度都为O(m*n)

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

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

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

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

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

题目： You are given n pairs of numbers. In every pair, the first number is always smaller than the second number.Now, we define a pair (c, d) can follow another pair (a, b) if and only if b < c. Chain o

题目： 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 = 2, ret

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

题目： You 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 them is that adjacent h

题目： Given 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]sumRange(0, 2) -> 1sumRange(2, 5) -> -1sumRange(0,

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

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

题目： Say you have an array for which the ith element is the price of a given stock on day i.If you were only permitted to complete at most one transaction (ie, buy one and sell one share of the stock),

题目描述： 我们可以用2*1的小矩形横着或者竖着去覆盖更大的矩形。请问用n个2*1的小矩形无重叠地覆盖一个2*n的大矩形，总共有多少种方法？思路： 这题和前面的那道跳台阶是一模一样的题，也是动态规划，这里的2*1的小矩形横着放就是跳2阶，竖着放就是跳1阶，当大矩形长度小于等于2时，方法数量为长度本身；当大于2时，即为d[i]=d[i-1]+d[i-2],但是递归调用太耗时，就用迭代。代码：cla

题目描述： 一只青蛙一次可以跳上1级台阶，也可以跳上2级……它也可以跳上n级。求该青蛙跳上一个n级的台阶总共有多少种跳法。思路： 这个其实是一道动态规划问题，d[1]=1,d[i]=d[i-1]+d[i-2]…+d[1]+1。但是有结果是pow(2,number-1)的规律，所以直接返回结果。代码：class Solution {public: int jumpFloorII(int

题目： Given a non negative integer number num. For every numbers i in the range 0 ≤ i ≤ num calculate the number of 1’s in their binary representation and return them as an array.Example: For num = ...