leetcode
人是祈祷的X
这个作者很懒,什么都没留下…
展开
-
[DP]35. Search Insert Position
这个真 水题 问题描述: Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order. You may assume no dupli原创 2018-01-25 00:06:33 · 126 阅读 · 0 评论 -
[DP]1.two sum
题目描述: Given an array of integers, return indices of the two numbers such that they add up to a specific target. You may assume that each input would have exactly one solution, and you may not use th原创 2018-01-29 10:55:11 · 141 阅读 · 0 评论 -
[DP]63. Unique Paths I
题目描述: 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 empty space is marked as 1 and 0 respectivel原创 2018-01-29 10:07:48 · 99 阅读 · 0 评论 -
[DP]62. Unique Paths
题目描述: 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 point in time. The robot is trying to原创 2018-01-27 15:51:09 · 162 阅读 · 0 评论 -
[DP]303. Range Sum Query - Immutable
题目描述 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) -> 1 sumRange(2, 5)原创 2018-01-27 10:52:50 · 144 阅读 · 0 评论 -
[DP]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 only constraint stopping you from robbing each of them is that adj原创 2018-01-26 21:10:28 · 125 阅读 · 0 评论 -
[DP]64. Minimum Path Sum
题目描述: 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. Note: You can only move either down or原创 2018-02-02 17:27:05 · 150 阅读 · 0 评论 -
[DP] 121.Best Time to Buy an Sell stock
题目描述 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 t原创 2018-01-24 16:22:26 · 151 阅读 · 0 评论 -
[DP]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 many distinct ways can you climb to the top? Note: Given n will be a posi原创 2018-01-24 23:31:27 · 113 阅读 · 0 评论 -
[DP]91. Decode Ways
问题描述:A message containing letters from A-Z is being encoded to numbers using the following mapping:'A' -> 1 'B' -> 2 ... 'Z' -> 26 Given an encoded message containing digits, determine the to...原创 2018-02-11 10:41:04 · 148 阅读 · 0 评论