LeetCode
文章平均质量分 71
No11101
这个作者很懒,什么都没留下…
展开
-
[LeetCode] 335. Self Crossing
You are given an array x of n positive numbers. You start at point (0,0) and moves x[0] metres to the north, then x[1] metres to the west, x[2] metres to the south, x[3]metres to the east an原创 2016-03-06 00:50:40 · 215 阅读 · 0 评论 -
[LeetCode] 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, ret原创 2016-04-19 23:17:52 · 154 阅读 · 0 评论