leetcode
jingza
这个作者很懒,什么都没留下…
展开
-
413. Arithmetic Slices(等差级数)
标签(空格分隔): leetcode dpA 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 ar原创 2017-08-24 22:56:48 · 329 阅读 · 0 评论 -
70. Climbing Stairs(登高)
标签(空格分隔): leetcode dpYou 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 wi原创 2017-08-24 21:45:38 · 340 阅读 · 0 评论 -
121. Best Time to Buy and Sell Stock
标签(空格分隔): leetcode dpSay 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 shar原创 2017-08-24 21:19:03 · 266 阅读 · 0 评论 -
198. House Robber(入室强盗)
标签(空格分隔): leetcode dpYou 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原创 2017-08-24 20:54:32 · 381 阅读 · 0 评论 -
53. Maximum Subarray(最大子序列)
标签(空格分隔): leetcode dp#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 subar原创 2017-08-24 20:53:47 · 244 阅读 · 0 评论 -
303. Range Sum Query - Immutable
标签(空格分隔): leetcode dp范围和查询-不可变的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) -> 1sumRan转载 2017-08-24 20:52:51 · 222 阅读 · 0 评论 -
12. Integer to Roman
Given an integer, convert it to a roman numeral. Input is guaranteed to be within the range from 1 to 3999.给定一个整数,将它转换成一个罗马数字。 输入是保证在范围从1到3999。罗马数字转换成整数: 首先要来了解一下罗马数字表示法,基本字符有7个:I,V,X,L,C,D,M,分别表示1,转载 2017-08-24 20:52:02 · 308 阅读 · 0 评论 -
11. Container With Most Water
标签(空格分隔): leetcode给定n个非负整数a1,a2,…,an,其中每个表示坐标(i,ai)处的点。绘制n条垂直线,使得线i的两个端点在(i,ai)和(i,0)处。找到两条线,它们与x轴一起形成一个容器,找到两条线,它们与x轴一起形成一个容器,使得容器含有最多的水。 注意:您不能倾斜容器,n至少为2。给定一个数组,(序列号,数值)形成一个坐标,然后就是选择两个坐标,这两个坐标的 垂线段原创 2017-08-24 20:51:31 · 248 阅读 · 0 评论 -
9. Palindrome Number(回文数)
确定一个整数是否是回文。做这个没有额外的空间。 一些提示: 1.负数是否是回文:(ie, -1) 2.如果您正在考虑将整数转换为字符串,请注意使用额外空间的限制。 3.您也可以尝试反转一个整数。但是,如果您已经解决了“反向整数”问题,则知道反向整数可能会溢出。你会如何处理这种情况? 4.有一个更通用的方法来解决这个问题。得到如下: 1.负数不是回文,整十数也不是回文 2.反转字符串,循原创 2017-08-10 21:25:08 · 257 阅读 · 0 评论 -
343. Integer Break
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, return原创 2017-09-01 09:37:49 · 310 阅读 · 0 评论