vir_lee的博客

一个机器人位于一个 m x n 网格的左上角 （起始点在下图中标记为“Start” ）。机器人每次只能向下或者向右移动一步。机器人试图达到网格的右下角（在下图中标记为“Finish”）。现在考虑网格中有障碍物。那么从左上角到右下角将会有多少条不同的路径？网格中的障碍物和空位置分别用 1 和 0 来表示。示例 1：输入：obstacleGrid = [[0,0,0],[0,1,0],[0,0,0]]输出：2解释：3x3 网格的正中间有一个障碍物。从左上角到右下角一共有 2 条不同的路径：

题目：给定N个项目的权重和价值（利润），将这些项目放入最大容量W的背包中，以获得背包中的最大总值（利润）。 递归解法：此时我们由这个问题得到了一个子问题通用的解决方案，来检查我得到的利润通过挑选项目或不挑选该项目这也就是选与不选的问题当我选择物品时，我需要将其从计算中移除，因为您已经对当前物品进行了处理，并通过拾取物品的重量减少了背包容量。 当我不选择物品时，我需要从计算中...

Eva loves to collect coins from all over the universe, including some other planets like Mars. One day she visited a universal shopping mall which could accept all kinds of coins as payments. However,...

Eva is trying to make her own color stripe out of a given one. She would like to keep only her favorite colors in her favorite order by cutting off those unwanted pieces and sewing the remaining parts...

Given a string, you are supposed to output the length of the longest symmetric sub-string. For example, given Is PAT&TAP symmetric?, the longest symmetric sub-string is s PAT&TAP s, hence you ...

Given a sequence of K integers { N~1~, N~2~, ..., N~K~ }. A continuous subsequence is defined to be { N~i~, N~i+1~, ..., N~j~ } where 1 <= i <= j <= K. The Maximum Subsequence is the continuo...

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 house...

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 top of th...

Pick OneGiven an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.Example:Input: [-2,1,-3,4,-1,2,1,-5,4],Output: 6Explan...

题目描述：骨牌。   有2*n 的地板，用1*2和2*1 的骨牌进行铺地板。问共有多少种情况。  结果对 999983 取余  。   1<=n<=10000 。  样例，                输入：6输出： 13思路：1.简单dp问题，地板铺设种类，满足斐波那契数列，dp[1]=1,dp[2]=2,dp[3]=3,dp[4]=5...........2.迭代法计算dp[n]...