- 博客(2)
- 收藏
- 关注
原创 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, re
2016-04-28 23:42:48 346
原创 LeetCode: 3. Longest Substring Without Repeating Characters
Given a string, find the length of the longest substring without repeating characters. Examples: Given “abcabcbb”, the answer is “abc”, which the length is 3. Given “bbbbb”, the answer is “b”,
2016-04-28 15:41:47 301
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人