![](https://img-blog.csdnimg.cn/20201014180756780.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
算法
捭阖寰宇
这个作者很懒,什么都没留下…
展开
-
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", with原创 2016-09-06 09:30:32 · 173 阅读 · 0 评论 -
LeetCode 322. Coin Change
public class Solution { private boolean []record; public int lengthOfLongestSubstring(String s) { record = new boolean[256]; int start = 0, count = 0, result = 0;原创 2016-09-07 10:34:15 · 263 阅读 · 0 评论 -
LeetCode 300. Longest Increasing Subsequence
Given an unsorted array of integers, find the length of longest increasing subsequence.For example,Given [10, 9, 2, 5, 3, 7, 101, 18],The longest increasing subsequence is [2, 3, 7, 101], theref原创 2016-09-07 11:32:39 · 238 阅读 · 0 评论 -
LeetCode 152. Maximum Product Subarray
Find the contiguous subarray within an array (containing at least one number) which has the largest product.For example, given the array [2,3,-2,4],the contiguous subarray [2,3] has the largest pr原创 2016-09-07 14:53:27 · 238 阅读 · 0 评论 -
LeetCode 53. Maximum Subarray
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 subarray [4,-1,2,1] has原创 2016-09-07 15:23:07 · 329 阅读 · 0 评论