码迷,mamicode.com
首页 >  
搜索关键字:substring with conca    ( 3920个结果
Palindrome Partitioning leetcode java
题目:Given a string s, partition s such that every substring of the partition is a palindrome.Return all possible palindrome partitioning of s.For exam....
分类:编程语言   时间:2014-08-01 10:30:01    阅读次数:218
[leetcode]Longest Palindromic Substring
Longest Palindromic SubstringGiven a stringS, find the longest palindromic substring inS. You may assume that the maximum length ofSis 1000, and there...
分类:其他好文   时间:2014-08-01 04:47:25    阅读次数:243
[leetcode]Longest Substring Without Repeating Characters
Longest Substring Without Repeating CharactersGiven a string, find the length of the longest substring without repeating characters. For example, the ...
分类:其他好文   时间:2014-07-31 23:46:00    阅读次数:256
Longest Substring Without Repeating Characters
Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters for "abcabcbb" is "abc", which the length is 3. Fo...
分类:其他好文   时间:2014-07-29 14:28:48    阅读次数:218
[LeetCode] Palindrome Partitioning II (DP)
Given a string s, partition s such that every substring of the partition is a palindrome.Return the minimum cuts needed for a palindrome partitioning ...
分类:其他好文   时间:2014-07-29 13:43:58    阅读次数:223
最长回文字串 (The longest palindrome substring)
这两天去学了一下,觉得下面那篇文章写的很好,有例子,比较容易懂,所以转一下。以下内容来自:hihoCoder:小Hi和小Ho是一对好朋友,出生在信息化社会的他们对编程产生了莫大的兴趣,他们约定好互相帮助,在编程的学习道路上一同前进。这一天,他们遇到了一连串的字符串,于是小Hi就向小Ho提出了那个经典...
分类:其他好文   时间:2014-07-29 12:41:26    阅读次数:292
AI---TinyDB的使用
//从数据库TinyDB1中读出"nameList"列的值并赋值给列表变量nameList,如果数据库中不存在"nameList"列,则将空列表赋值给nameList变量。//判断nameList变量是否为空,如果不为空,则遍历每一个元素,并输出。//segment相当于subString()函数,...
分类:数据库   时间:2014-07-29 11:34:46    阅读次数:517
Minimum Window Substring &&& Longest Substring Without Repeating Characters 快慢指针,都不会退,用hashmap或者其他结构保证
1 public class Solution { 2 public static int lengthOfLongestSubstring(String s) { 3 4 char[] arr = s.toCharArray(); 5 int pre = 0; 6 ...
分类:Windows程序   时间:2014-07-29 10:51:46    阅读次数:355
[LeetCode] Palindrome Partitioning
Given a string s, partition s such that every substring of the partition is a palindrome.Return all possible palindrome partitioning of s.For example,...
分类:其他好文   时间:2014-07-28 19:17:14    阅读次数:245
Minimum Window Substring leetcode java
题目:Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n).For example,S = "ADOBE....
分类:编程语言   时间:2014-07-28 14:42:23    阅读次数:264
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!