sure0328

摘要： leetcode 198. House Robber You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the 阅读全文

摘要： 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 阅读全文

摘要： leetcode 72. Edit Distance Given two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is co 阅读全文

摘要： leetcode 70. Climbing Stairs 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 阅读全文

摘要： Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path. 阅读全文

摘要： 62题题目见上个帖子 Follow up for "Unique Paths": Now consider if some obstacles are added to the grids. How many unique paths would there be? An obstacle and 阅读全文

摘要： A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below). The robot can only move either down or right at any p 阅读全文

摘要： leetcode 53. Maximum Subarray Find the contiguous subarray within an array (containing at least one number) which has the largest sum. For example, gi 阅读全文