码迷,mamicode.com
首页 >  
搜索关键字:longest consecutive    ( 3017个结果
687. Longest Univalue Path
这个题要注意一下,容易错,辅助遍历函数有返回值。 ...
分类:其他好文   时间:2018-06-09 20:31:34    阅读次数:199
674. Longest Continuous Increasing Subsequence
扫描一遍,问题不大 ...
分类:其他好文   时间:2018-06-09 15:31:49    阅读次数:124
【Leetcode】【Longest Substring Without Repeating Characters】【无重复字符的最长子串】【C++】
题目:给定一字符串,求其无重复字符的最长子串长度。 思路:for循环一次,时间复杂度为O(N)。字符的ascii值为32~126。start表示当前无重复字符子串的初始位置,初始值为0;可定义一个位置数组pos[128]表示for循环索引到当前位置时相应的字符对应的位置。若当前字符s[i](其asc ...
分类:编程语言   时间:2018-06-08 22:37:27    阅读次数:279
830. Positions of Large Groups
In a string S of lowercase letters, these letters form consecutive groups of the same character. For example, a string like S = "abbxxxxzyy" has the g ...
分类:其他好文   时间:2018-06-08 21:55:26    阅读次数:151
leetcode-409-Longest Palindrome(统计字母出现次数)
题目描述: Given a string which consists of lowercase or uppercase letters, find the length of the longest palindromes that can be built with those letters ...
分类:其他好文   时间:2018-06-07 19:18:44    阅读次数:170
1104 Sum of Number Segments (20)
Given a sequence of positive numbers, a segment is defined to be a consecutive subsequence. For example, given the sequence {0.1, 0.2, 0.3, 0.4}, we h ...
分类:其他好文   时间:2018-06-06 01:10:37    阅读次数:167
300. Longest Increasing Subsequence
题目描述: Given an unsorted array of integers, find the length of longest increasing subsequence. Example: Note: There may be more than one LIS combinatio ...
分类:其他好文   时间:2018-06-03 14:30:57    阅读次数:142
*521. Longest Uncommon Subsequence I (bit manipulation 2^n)
Given a group of two strings, you need to find the longest uncommon subsequence of this group of two strings. The longest uncommon subsequence is defi ...
分类:其他好文   时间:2018-06-03 14:20:25    阅读次数:146
*5. Longest Palindromic Substring (dp) previous blogs are helpful
Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000. Example 1: Input: "babad" Output: ...
分类:其他好文   时间:2018-06-02 12:55:40    阅读次数:157
673. Number of Longest Increasing Subsequence
class Solution { public: int findNumberOfLIS(vector& nums) { if (nums.size() == 0) return 0; pair res = {0, 0}; // vector> dp(nums.size(), {1,1}); // ... ...
分类:其他好文   时间:2018-06-01 16:20:29    阅读次数:112
3017条   上一页 1 ... 69 70 71 72 73 ... 302 下一页
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!